uz
Feedback
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Kanalga Telegram’da o‘tish

Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion

Ko'proq ko'rsatish
3 351
Obunachilar
-124 soatlar
-147 kunlar
-4730 kunlar
Postlar arxiv
n = int(input()) arr = list(map(int,input().split())) c = 0 for a in range(n-1):     c += min(arr[a],arr[a+1]) print(c) medium 2 balls code ✅

Guys please share our channel and show some love to me @ILOVEU_143 Give some reactions guys it will motivate us...✅😁

n=int(input()) l=[] m=[] for i in range(n):     l.append(input()) for i in range(n):     for j in range(i+1,n):         if(l[i]==l[j][::-1]):             m.append(l[i]) for i in range(len(m)):     x=len(m[i])     l=int(x/2)     print(m[i][l]) medium 1 code python idp✅

Guys please share and show some love to me @ILOVEU_143 Give some reactions guys it will motivate us...✅😁

Guys nobody will ask u dsa basic questions 😅 They will ask u how u implemnt the real time use approch like algorithm and tree, graphs linkedlist ,stack queue implementation so prepare these topics 💥💥

Any one want projects -mini or Major 😊 Domain AI/ML contact -@ILOVEU_143 Note -paid 🤑 share✅ share ✅@Coding_000

🆓🆓🆓🆓 We provide help and support for all placement exams JOIN our channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for promotions or booking your exam slots 💯% clearance in any placement exams ✅ https://t.me/Coding_000

My request to our group family don't trust anyone simply and don't lose money 🙏🥹