cookie

We use cookies to improve your browsing experience. By clicking «Accept all», you agree to the use of cookies.

avatar

All exam answers

Job updates only

Show more
Advertising posts
1 027
Subscribers
No data24 hours
-67 days
-1930 days

Data loading in progress...

Subscriber growth rate

Data loading in progress...

Show all...
Tata Steel Placement Material https://telegram.me/placementlelo ✅ Download this pdf and upload it in your college whatsapp and telegram groups and help your friends.
Show all...
✅ IBM CODEKNACK PATTERN 30 minutes for 1 coding question IBM Previous Exam 👇 https://youtu.be/4ozB0jHWQ_A
Show all...
Three Subarrays Python https://telegram.me/PLACEMENTLELO def max_sum_subarrays(A):     n = len(A)     dp1 = [0] * n     dp2 = [0] * n     dp3 = [0] * n     dp1[0] = A[0]     for i in range(1, n):         dp1[i] = max(dp1[i-1] + A[i], A[i])     dp2[n-1] = A[n-1]     for i in range(n-2, -1, -1):         dp2[i] = max(dp2[i+1] + A[i], A[i])     dp3[0] = A[0]     for i in range(1, n):         dp3[i] = max(dp3[i-1], dp1[i-1] + dp2[i+1], 0) + A[i]     max_sum = float('-inf')     for i in range(1, n-1):         max_sum = max(max_sum, dp3[i])     return max_sum Three Subarrays Python https://telegram.me/PLACEMENTLELO
Show all...
Many of the people have recieved mail for goodies 🔥 Fast register guys before it ends ⭐
Show all...
IBM PLACEMENT MATERIAL http://telegram.me/placementlelo PREVIOUS YEAR CODING QUESTIONS AND ANSWERS :- http://bit.ly/3iylB52
Show all...
We have came across a bug in coding ninjas website servers. Many people are getting free goodies email immediately after registering in the test. Register Fast 👇 http://bit.ly/3IVcoN5 Try your luck as it is free of cost to register, There is nothing to lose in this. So Register Fast before they correct this glitch. Register Fast 👇 http://bit.ly/3IVcoN5 http://bit.ly/3IVcoN5 http://bit.ly/3IVcoN5
Show all...
Find the Evil Monster Code Python https://telegram.me/PLACEMENTLELO for _ in range(int(input())):   n = int(input())   k = list(map(int, input().split()))   h = list(map(int, input().split()))   st = []   for i in range(n):     st.append([k[i] - h[i], k[i]])   st.sort()   l, r = -1, -1   ans = 0   for it in st:     if it[0] >= r:       ans += (r - l) * (r - l + 1) // 2       l, r = it     else:       r = max(r, it[1])   ans += (r - l) * (r - l + 1) // 2   print(ans) Find the Evil Monster Code Python https://telegram.me/PLACEMENTLELO
Show all...
IBM Discussion Group 👇 https://telegram.me/+PIVbtXnoJf5lOWQ1
Show all...
Get all Job alerts, placement material, paid internship updates here👇 @PLACEMENTLELO @PLACEMENTLELO @PLACEMENTLELO
Show all...