TCS NQT 2PM SLOT AUGUST 20 ✅💯

Reasoning 💯💯

1.BDF
2.A B C
3.B
4.D
5.C
6.D
7.D
8.A
9.socialogy
10.the candidate should be admitted
11.a medico
12.only ii
13.both a an r
14.4
15.B
16.
17.B
18.JLR
19.science
20.9


📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

Keep Sharing ✅Keeping Sharing ✅

In your WhatsApp groups and our channel screenshot in large groups 🙏🏻🙏🏻🙏🏻

TCS NQT 2PM SLOT AUGUST 20 ✅💯

ADVANCE 💯💯

1.5/48
2.45 C
3.3
4.B
5.15
6.4
7.291060
8.2016
9.marketing
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.


📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

Keep Sharing ✅Keeping Sharing ✅ make our channel 3K for Free coding answers ✅💯💯

In your WhatsApp groups and our channel screenshot in large groups 🙏🏻🙏🏻🙏🏻

No sharing No code 😜😉

Hurry up and share our channel Screenshot in large gorups ✅✅

Scroolup👆👆For Answers 👆👆

TCS NQT 2PM SLOT AUGUST 20 ✅💯

ADVANCE 💯💯

1.5/48
2.45 C
3.3
4.B
5.15
6.4
7.291060
8.2016
9.marketing
10.accounting


Advance Reasoning 💯✅
11.No
12.puma
13.171820911
14.14
15.data in both statement
16.Candidates is not to be selected
17.Harsh
18.UBPJDJQU


📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

Keep Sharing ✅Keeping Sharing ✅ make our channel 3K for Free coding answers ✅💯💯

In your WhatsApp groups and our channel screenshot in large groups 🙏🏻🙏🏻🙏🏻

Who need codes mesg to @rockycoder780

It's paid 200/- for both codes 🏃🏃🏃🏃🏃😌✅✅💯💯


All test cases passed

N=int(input())
K=int(input())
price=list(map(int,input().split()))
vol=list(map(int,input().split()))
maxvol=0
volu=0
maxvol=max(vol)
for i in range(0,N):
    if (maxvol==vol[i] and price[i]<=K):
        K=K-price[i]
        volu=maxvol
for i in range(0,N):
    for j in range(i+1,N+1):
        if (price[i]<=K and price[i]==price[j]):
            if (vol[i]>vol[j]):
                volu=volu+vol[i]
                K=K-price[i]
            else:
                volu=volu+vol[j]
                K=K-price[j]
        elif (price[i]<=K and price[i]!=price[j]):
            K=K-price[i]
            volu=volu+vol[i]
print(volu)


Vijay Industrial code ✅
Stream : Python 💯

📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

N=int(input())
K=int(input())
price=list(map(int,input().split()))
vol=list(map(int,input().split()))
maxvol=0
volu=0
maxvol=max(vol)
for i in range(0,N):
    if (maxvol==vol[i] and price[i]<=K):
        K=K-price[i]
        volu=maxvol
for i in range(0,N):
    for j in range(i+1,N+1):
        if (price[i]<=K and price[i]==price[j]):
            if (vol[i]>vol[j]):
                volu=volu+vol[i]
                K=K-price[i]
            else:
                volu=volu+vol[j]
                K=K-price[j]
        elif (price[i]<=K and price[i]!=price[j]):
            K=K-price[i]
            volu=volu+vol[i]
print(volu)


Vijay Industrial code ✅
Stream : Python 💯

📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python

n=int(input())
k=int(input())
mon=[]
for i in range(n):
mon.append(int(input()))
mi=min(mon)
ma=max(mon)
ma=ma-k
mi=mi+k
diff=ma-mi
print(diff)


Readington Code ✅
Stream :Python 3💯

📌📌 Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python


✅✅Share ✅✅share ✅✅share