Off Campus Job Update
Відкрити в Telegram
500+ Placement & Competitive Exam Materials 75+ Companies Materials 100+ JOB Updates in a Month 🚀DM for Promotion @Wren_0 🚀Placement Updates: @offcampusjobs_0 🌟 Placment Material: @placement_materials0
Показати більше
Сітка:8 266
Підписники
Немає даних24 години
Немає даних7 днів
-12430 день
Архів дописів
Aptitude
1. D(6)
2. 3.1746341
3. 5.5
4.2
5. 12 years
6. 9
7. 50
8. 3320.5
9. 10565
10. 26000
11. 25
12. 13.024
13.
14.
Telegram- https://t.me/Coding_solution_0
10 am. TCS exam
plz follow this format to answer
1)12
2)3.174634146..
3)4.5
4)2
5)12 years
6)9
7)50
8)3320.5
9)10565
10)26000
11)25%
12)13.024
13)
14)
15)
16)
17)
18)
19)
20)
21)
22)
23)
24)
25)
26)
27)
28)
30)
https://t.me/Coding_solution_0
Aptitude
1. D(6)
2. 3.1746341
3. 5.5
4.2
5. 12 years
6. 9
7. 50
8. 3320.5
9. 10,565
10.c
Telegram- https://t.me/Coding_solution_0
10 am. TCS exam
plz follow this format to answer
1)12
2)3.174634146..
3)4.5
4)2
5)12 years
6)9
7)50
8)3320.5
https://t.me/Coding_solution_0
9)
10)
11)
12)
13)
14)
15)
16)
17)
18)
19)
20)
21)
22)
23)
24)
25)
26)
27)
28)
30)
https://t.me/Coding_solution_0
✅Guys share screenshots to alrge groups then I can post answers fast
✅Share ✅Share
Aptitude
1. D(6)
2. 3.1746341
3.5.5
4.2
5.12 years
6.9
Share 🚀Share 🚀
https://t.me/Coding_solution_0
Aptitude
1. D(6)
2. 3.1746341
3.
4.2
5.
6.
Telegram- https://t.me/Coding_solution_0
✅Plaese subscribe our YouTube channel for Daily Job 📣 Updates
https://youtube.com/channel/UCmYO_4lgP8V5qRAunlc9wSg
Add your 5 friends in this group, We will Add you in a private group for Tomorrow Exam Solution.
TCS NQT & CAPGEMINI EXAM TOMORROW SOLUTION GROUP
👇👇
https:- https://t.me/good_coders
![arr = [1, 2, 3, 4, 2, 7, 8, 8, 3]; print("Duplicate elements in given array: "); #Searches for duplicate element for i in ran](https://cdn.tlmtr.io/_next/static/media/empty-channel.35ed232f.svg)
arr = [1, 2, 3, 4, 2, 7, 8, 8, 3];
print("Duplicate elements in given array: ");
#Searches for duplicate element
for i in range(0, len(arr)):
for j in range(i+1, len(arr)):
if(arr[i] == arr[j]):
print(arr[j]);
Telegram-
https://t.me/Coding_solution_0
*InterntextEditor*
int n=scn.nextInt();
String a[]=new String[n];
String k="",kk="";;
for(int i=0;i<n;i++)
{
a[i]=scn.nextLine();
}
for(int i=0;i<n;i++)
{
String z[]=a[i].split(" ");
if(Integer.parseInt(z[0])==1)
{
kk=k;
k=k+z[1];
}
else if(Integer.parseInt(z[0])==2)
{
kk=k;
k=k.substring(0,k.length()-Integer.parseInt(z[1]));
}
else if(Integer.parseInt(z[0])==3)
{
System.out.println(k.charAt(Integer.parseInt(z[1])));
}
else if(Integer.parseInt(z[0])==4)
{
k=kk;
}
}
INTERN TEXT EDITOR
https://t.me/Coding_solution_0
Tomorrow Epam solutions group--
Epam pattern :
1) 10 aptitude question for 15 min
2) 2 coding question
3) 10 english question
4)10 reasoning question
https://t.me/Coding_solution_0
awk 'BEGIN{FS="|";OFS=",";count=0}
(NR>1){
print $1,$3
count = count + 1
}END{
if(count == 0){
print "No records found."
}
}'
Painter code
Telegram- https://t.me/Coding_solution_0
