Daily jobs Updates

Teacher Code in C++👍😁 https://t.me/offcampusjobs_0

Code cyclone https://t.me/offcampusjobs_0

char *removeSpaces(char *str) { int i = 0, j = 0; while (str[i]) { if (str[i] != ' ') str[j++] = str[i]; i++; } str[j] = '\0'; return str; } int main() { char str1[] = "gee k "; cout << removeSpaces(str1) << endl; char str2[] = " g e e k "; cout << removeSpaces(str2); return 0; } social networking site https://t.me/offcampusjobs_0

1) hcf of 2 no is 48=16 2) If a 10 digit no 8750a649b2 is divisible...= 13 3) odd one out= [5 Percent of 180-20] 4) (12.34-8.23)/(12.34+8.24)÷... = 1/10 5) The light in top of three billboard= 11.30.06Pm 6) 5^²- x 25^a/²x.... = 25 7) If k= (3/10x3⅖÷ 17/46)= 1.6 to 1.7 8) Simplify 4-³x16⁵/⁴x 32.. = 1/8 9) If x³-1/x=k³+3k == 1 10) 1 ¹/24÷{1¹/⁴x(.... = 2/ 11) Jayanti and Indu= 2250 12) Among those who do not exchange= 12 13)If x=(2/3)²x(3/2)⁵= -5/4 14) The gst Rate = 12.5% 15( In a local elections= 1240 16) A family average= 25% 17) The square of natural no= 40 18) An article was marked at 1320=. 63.63% Join for more ❤️ https://t.me/offcampusjobs_0

1) hcf of 2 no is 48=16 2) If a 10 digit no 8750a649b2 is divisible...= 13 3) odd one out= [5 Percent of 180-20] 4) (12.34-8.23)/(12.34+8.24)÷... = 1/10 5) The light in top of three billboard= 11.30.06Pm 6) 5^²- x 25^a/²x.... = 25 7) If k= (3/10x3⅖÷ 17/46)= 1.6 to 1.7 8) Simplify 4-³x16⁵/⁴x 32.. = 1/8 9) If x³-1/x=k³+3k == 1 10) 1 ¹/24÷{1¹/⁴x(.... = 2/ 11) Jayanti and Indu= 2250 12) Among those who do not exchange= 12 13)If x=(2/3)²x(3/2)⁵= -5/4 14) The gst Rate = 12.5% 15( In a local elections= 1240 16) A family average= 25% 17) The square of natural no= 40 18) An article was marked at 1320=. 63.63% Join for more ❤️ https://t.me/IT_JOB_UPDATES

TCS All Slots Solution Available Here join now ❤️ 👇👇 https://t.me/offcampusjobs_0

Social Distance https://t.me/offcampusjobs_0

#include <bits/stdc++.h> using namespace std; int main() { string s = ""; cin >> s; int length = s.size(); int result = 0; for (int i = length - 1; i >= 0; i--) { if ((s[i] - '0') % 2 == 0) result += i + 1; } cout << result << endl; return 0; } FisherMan code !! https://t.me/offcampusjobs_0

String Code Join for more ❤️ https://t.me/offcampusjobs_0

Earth green Join for more ❤️ https://t.me/offcampusjobs_0

Xor and count PYTHON code def xexamster(n,arr,queries): ans = [] lst = [0] for i in arr: lst.append(i) for i in queries: sublist = [] l,r = i[0],i[1] res = helper(l,r) for j in res: temp = [lst[k] for k in range(j[0],j[1]+1)] X=0 for k in temp: X^=k if (X^1)==(X+1): sublist.append(j) ans.append(len(sublist)) return ans def helper(l,r): res = [] i=l while i<=r: for j in range(i,r+1): res.append([i,j]) i+=1 return res n = int(input()) m = int(input()) lst = list(map(int,input().split())) q = [] for i in range(m): l,r = map(int,input().split()) q.append([l,r]) result = xexamster(n,lst,q) print(*result) Xor and count PYTHON code Join for more https://t.me/offcampusjobs_0

TCS All Slots Solution Available Here join now ❤️ 👇👇 https://t.me/offcampusjobs_0

TCS All Slots Solution Available Here join now ❤️ 👇👇 https://t.me/offcampusjobs_0

🏃TODAY IS THE LAST DATE FOR REGISTRATIONS🏃 🚀Only 2022 Passout 🎯Wipro Elite NLTH Offcampus Eligibilty: B.E/B.Tech/5yrs Integ-M.Tech Branch: CS/IT/Circuital CTC: INR 3.50 lpa 📌Apply: https://careers.wipro.com/elite Share with your friends❤️❤️ https://t.me/offcampusjobs_0

TCS All Slots Solution posted Here join now 👇👇 https://t.me/offcampusjobs_0

JOB JOB JOB JOB ❤️ ⚠️ Reminder - who didn't apply yet ✅TCS - https://t.me/offcampusjobs_0/629 ✅INFOSYS - https://t.me/offcampusjobs_0/635 ✅COGNIZANT - https://t.me/offcampusjobs_0/683 ✅EPAM- https://t.me/offcampusjobs_0/672 ✅INCEDO- https://t.me/offcampusjobs_0/632 🔆Share in ur College WhatsApp Groups https://t.me/offcampusjobs_0

Recycle code🚀🚀 https://t.me/offcampusjobs_0 c=int(input()) p=int(input()) ans=0 flag=True while(flag): if(c%10==0): ans=c//10 flag=False elif(((ans-1)*10+p)%c==0 or ((ans-1)*10)%c==0): ans+=1 flag=False else: ans+=1 print(ans) Recycle code🚀🚀 https://t.me/offcampusjobs_0

Survey Code:::: N=int(input()) T=[] ev=0 for i in range(N): T.append(int(input())) dup=set(T) for i in dup: if T.count(i)%2==0: ev=ev+1 if ev==0: print(-1) else: print(ev) Housing society 🚀🚀 https://t.me/offcampusjobs_0

Customer code🚀🚀 https://t.me/offcampusjobs_0

Annual Carnival Code🚀🚀 https://t.me/offcampusjobs_0