Whenever I got struck in solving LOVE BABBAR'S DSA SHEET, i instantly write code library = " question name " and got an awesome video. Thank u so much and Keep going ahead !!!!!

@VK_BRANDING

5 ай бұрын

really bro thats true what are u doing now bro u are in college student or doing job ??

bhai line number 37 m min(n-1,arr[i].dead-1) aayege taaki agar n select hua to outOfBound na hojaye done[j]... But still aapka code successfully submit hogya.. Anyways, Explaination was brilliant..Thnxx

achaa hua aap mil gaye java me code karne wale me to ye hi dundh raha tha...bhai you are awesome

Very Simple Straight forward Solution , I got easily understood than any other solution video . Thankyou Sir

now after two week understood intuition from your video

Can you please tell what does the last question in DSA Sheet, "Power Set", has to do with bit manipulation? Thanks.

@lone_wolf7721

3 жыл бұрын

Question dekho aache se bit pe khel ke power set nikalna hai

honestly this was explained better than striver's explanation :)

Expected Time Complexity : O(NlogN) hai toh O(N2) kaise chal gaya bhai? Mera TLE aa rha hai. Also, if possible please upload an O(NlogN) solution

@AmAnKumAr-tg4fy

2 жыл бұрын

yae sare mil kr pagal bana rahe hai hm ko

@ayushsharma9640

2 жыл бұрын

bro this is the greedy approach it can be optimized to O(nlogn) by using priority queue

@neerajchoudhary3709

2 жыл бұрын

hey since max number of deadline can only be 100, hence it gives a complexity of 100*n+nlogn instead of n^2, that why it worked

Thanks for the nice explanation

please increase the volume

thnaks brother

Very good explanation

gfg pe submit nh ho rha

thanks bro

Anyhow are u form Bengal bro ?? 😁😁

Which application do you use for drawing and explaining concepts?

@namansharma5128

2 жыл бұрын

windows OneNote

segmentation fault aa rha h

bade bahi optimized approach batao

matrix ka pehle solve karo plz why u skipped matrix problems?

Very well explained

bhai coding krne pe or karane me farak hota hai

vector vec = {{100, 2}, {27, 1}, {19, 1}, {25, 1}, {15, 1}}; int n = vec.size(); int ans = 0; int arr[vec.size()] = {0, 0, 0, 0, 0}; int count = 0; for (int i = 0; i != n; i++) { if (arr[vec[i].second - 1] == 0) { ans += vec[i].first; arr[vec[i].second - 1] = 1; count++; } } cout

Bro you are better than many who are trying to explain similar..you have got that right idea to explain code as well as approach

Bhai GFG me limit nlogn hai tera submit kaise hua?

@nihaljaiswal1839

3 жыл бұрын

the constraint for deadline is 100 so second loop run only 100 times in worst scenario so time complexity of that nested loop will be O(n*100) and time complexity for sorting is O(nlogn).so overall time complexity is O(n*100)+ O(nlogn)~O(nlogn)

@bhairavnathbhardwaj127

2 жыл бұрын

@@nihaljaiswal1839 Great Explanation Nihal .👍👍👍

mic

Sir plz aram aram s smjaya kro we r the beginer not the topper......

Runtime error aa raha hai is code me

@harshitakhemani

3 жыл бұрын

min(n, arr[i].dead) nahi hoga n-1 hoga iski jagah

@raviashwin1157

3 жыл бұрын

@@harshitakhemani Thanks🙂

@SubhamKumar-9009

3 жыл бұрын

nahi

i dont get it why only 2 jobs when we can do all jobs yogesh bahi @Yogesh & Shailesh