Видео

Fancy that. Yet again my response to the second part of your question has been deleted. Somebody is trying to prevent us from communicating. I give up.

14:44 to 18:41 , this is right intuition and wonderful explanation, i watched more than 10+ videos ,no one explained. Thank so much bro.

Nice explaination!!

O(m log k) is not necessarily the most efficient use of a PQ. If you have the ability to "heapify" an array (this is usually a O(m) operation) then you can use the m sized max heap and pop the top (k - 1) times for a run time of O(m + k log m) which is usually faster - especially if k is small.

Note -> We can easily optimize it to TC -> O(N) and SC -> O(N). As i am little busy, so i have told you that in Video. You can check the optimized solution in Description. Thank you

Such a nice explanation

are you from INDIA ?

Sir i think you can upload a small videos on shorts so that the channel get popular because your channel have the potential of big channel i watch your videos regularly it was helpful for me to grasp in-depth knowledge

I am a little late. But it's done.🔥🔥

Today's problem done✅

great!!

nice

Why did you break your streak😢?

Done✊🏼

As always, great explanation.

sir try to do dry runs of diff example..

You were out for sometime. Good to have you back brother.🤠

could you make a video for this problem with backtracking solution Minimum Number of Work Sessions to Finish the Tasks

But [1,1,6] is also a solution, I don't get how it still will include the 1 twice

thank you for your video !! ❤

I solved this problem using bucket sort, but glad to know this beautiful approach ❤ Bro Union-find wale playlist ka intezar or kb tk wait krna hoga ?

very good explanation.

The most important point, which language you're using, is missing

In title or description, i don't see which language you're using..

Good work man. Thanks for the explanation ❤

thank you for great explanation and great idea

Thank You bro ❤ bro can you explain the same problem using union-find too, it would be helpful

Such a beautiful explanation ❤

thank you for easy explanation!

Please can u tell ur leetcode id want to see ur submission

you are a genius sir

hi bro ! i see u are putting lot of efforts on solution, it is my one of the long-time desire to create educational content, if you are okey i would like to contribute towards making such educational videos, but covering other topics as well... i'm afraid of starting new things since you have already started and having a similar-minded person like you would be very helpful and motivating to kick start myself, looking forward for your response! thanks!

Your way of explaining and then typing code in the ordered way as you explained is very good thing, unique way

111000 how it requires 3 swaps?? it only need 2 right :?

very well explained

Thank you bro. I still can't understand memorization part. The execution shouldn't be like a tree? Left branch is put to next shelf, right is put to same shelf. Every recursive is necessary? 1 / \ 2 / \ 3 / \ ... / ⑦ \ n - 1 /③ \④ n /① \② /⑤ \⑥ If the execution done ① and ②, store the value "dp [ n ] [ width ] = xx", then go back to ③. Then it will start from ④. The execution is from ⑤ to ⑥, then will it found "dp[ n ][ width ]" has the value that previous get from ① and ②. Then return and give the control back to ④ , then ④ back to ⑦. Is ④ better then ③？It has lower height since it's put on the same shelf instead of put on a new shelf? Am I understand right? Thx if and explanation!

thanks a lot !! understood all but didnt understand the last part of memoization, how or where to learn that ?any particular problem to solve ? also,I am new to DP

best explanation right from recurssion -> memoization -> tabulation thank you bro.

Your solutions helps alot

Amazing as usual ❤❤

The way you broke down the problem and walked through the solution made it so clear.

bhai great explanation really helpful one

Bro the video explanation was vey super i never understand recursion like this because when i going for learn recursion they always teach me Fibonacci, factorial but this was fantabulous, thankyou brother keep uploading ❤❤❤

This question is a CF level question

bhai description mei galat q aur ans daal dia

Great explanation 👍