Reasoning
1)Shri
2)A and C
5) data in statement 2 alone ....
6)data is insufficient
7) Peternal grandfathers brother
8)T*U#V....
9)Suraj and Hill
10)the candidate is to be selected
Telegram:- @allcoding1
1)Shri
2)A and C
5) data in statement 2 alone ....
6)data is insufficient
7) Peternal grandfathers brother
8)T*U#V....
9)Suraj and Hill
10)the candidate is to be selected
Telegram:- @allcoding1
😢25👍22❤3
👍20❤7👎4
👍36❤14🥰2🔥1
👍32❤10🔥3👏3🤩3👎2
Advanced apitude
1)5/24
2)228
3)48X^2+21X+102=0
4) 30,30
5) 14
6) 41
7) 12870
8) ii and iii
9) 2 and 3 only
Telegram:- @allcoding1
1)5/24
2)228
3)48X^2+21X+102=0
4) 30,30
5) 14
6) 41
7) 12870
8) ii and iii
9) 2 and 3 only
Telegram:- @allcoding1
👍27❤6👎4🔥4🎉3
Advanced apitude
1)5/24
2)228
3)48X^2+21X+102=0
4) 30,30
5) 14
6) 41
7) 12870
8) ii and iii
9) 2 and 3 only
Telegram:- @allcoding1
1)5/24
2)228
3)48X^2+21X+102=0
4) 30,30
5) 14
6) 41
7) 12870
8) ii and iii
9) 2 and 3 only
Telegram:- @allcoding1
❤32👍9🔥6🤯5😢4🥰3🤩2
Advanced apitude
1)5/24
2)228
3)48X^2+21X+102=0
4) 30,30
5) 14
6) 41
7) 12870
8) ii and iii
9) 2 and 3
10)1 and 4 only
Telegram:- @allcoding1
1)5/24
2)228
3)48X^2+21X+102=0
4) 30,30
5) 14
6) 41
7) 12870
8) ii and iii
9) 2 and 3
10)1 and 4 only
Telegram:- @allcoding1
👍26❤15🔥6🤩5
Advance apti answers
1. 5/24
2. 352
3. 48x^2-273x+338=0
4. 30,30
5. 120
6. 15
7. 1080
8. II and III only
9. I and II only
10. I and IV only
Telegram :- @allcoding1
1. 5/24
2. 352
3. 48x^2-273x+338=0
4. 30,30
5. 120
6. 15
7. 1080
8. II and III only
9. I and II only
10. I and IV only
Telegram :- @allcoding1
👍30👎11❤7🤯7😢7
n=int(input())
jk=list(map(int,input().split()))
jl=list(map(int,input().split()))
l=len(jk)
jksum=0
jlsum=0
lind=[]
while l!=0:
b=[]
ind=jk.index(max(jk))
jksum+=max(jk)
lind.append(ind)
//@allcoding1
for i in range(0,len(jl)):
if i not in lind:
b.append(jl[i])
l-=1
jlsum+=max(b)
if jksum>jlsum:
print("jack")
elif jksum==jlsum:
print("Tie")
else:
print("jill")
Python
Jack and Jill Code
Telegram - @allcoding1
jk=list(map(int,input().split()))
jl=list(map(int,input().split()))
l=len(jk)
jksum=0
jlsum=0
lind=[]
while l!=0:
b=[]
ind=jk.index(max(jk))
jksum+=max(jk)
lind.append(ind)
//@allcoding1
for i in range(0,len(jl)):
if i not in lind:
b.append(jl[i])
l-=1
jlsum+=max(b)
if jksum>jlsum:
print("jack")
elif jksum==jlsum:
print("Tie")
else:
print("jill")
Python
Jack and Jill Code
Telegram - @allcoding1
👍15👎7
👍26🥰5👏3