Accenture Goldman Sachs SOLUTION🚀

CHANNEL ❤️
https://t.me/Coding_solution_0

PRIVATE GROUP 👇
https://t.me/good_coders

JOB UPDATES
https://t.me/offcampusjobs_0

✅ Share post in ur college Whatsapp grps.

C

14
https://t.me/Coding_solution_0

A
https://t.me/Coding_solution_0

TCS verbal

1) that

2.Of 39 years on July 4, 1902..

3. were inaugarated yesterday

15) I got lost at the fair and was scared

@) migrant worker

@) SAG
@) PR
@) There are celebrity chef in Mexican...

https://t.me/Coding_solution_0

TCS NQT SOLUTION 🚀
https://t.me/solution_exam

GOLDMAN SACHS SOLUTION 🚀
https://t.me/Solution_Coding

Ev_ whole minute Dilemma code

n=int(input())
l=list(map(int,input().split()))
c=0
for i in range(0,len(l)):
for j in range(i+1, len(l)):
s=l[i]+l[j]
if s%60==0:
c=c+1
print(c)

Telegram
https://t.me/Coding_solution_0

#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
if(n<100 || n>200){
cout<<"INVAILD INPUT";
return 0;
}
if(n%2==0){
int div=n/4;
for (int i=0;i<4;i++){
cout<<div<<endl;
}
}
else{
int div=n/4;
int temp=n-(div*3);


for (int i=0;i<3;i++){
cout<<div<<endl;
}
cout<<temp;
}
}

C++

TCS exam

Telegram
https://t.me/Coding_solution_0

177
https://t.me/Coding_solution_0

S9
https://t.me/Coding_solution_0

273

GOLDMAN SACHS 3PM SOLUTION GROUP 👇
Telegram-
https://t.me/Coding_solution_0

Today Exam All Solution

Channel ❤️
https://t.me/Coding_solution_0

Group❤️
https://t.me/good_coders

CODING_SOLUTION_HELP:
TCS 10 AM BATCH Aptitude
1 1.3087
2 36.055
3 B (2)
4 .A
5.40
6.60

Telegram-
https://t.me/Coding_solution_0
7.97
9.7.44
10.5

https://t.me/Coding_solution_0

CODING_SOLUTION_HELP:
TCS 10 AM BATCH Aptitude
1 1.3087
2 36.055
3 B (2)
4 .A
5.40
6.60

Telegram- https://t.me/Coding_solution_0

7.97
9.7.44
10.5
11.50
12.3600

Send the questions will send the Solution🚀🚀