Egg Dropping Problem Dynamic Programming | Leetcode Hard Solutions

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this problem, we discuss the egg dropping problem using dynamic programming. In this problem,

1. You are given two integers N and K. N represents the number of eggs and K represents the number of floors in a building.
2. You have to find the minimum number of attempts you need in order to find the critical floor in the worst case while using the best strategy.
3. The critical floor is defined as the lowest floor from which you drop an egg and it doesn't break.
4. There are certain which you have to follow -
a. All eggs are identical.
b. An egg that survives a fall can be used again.
c. A broken egg can't be used again.
d. If the egg doesn't break at a certain floor, it will not break at any floor below.
e. If the egg breaks at a certain floor, it will break at any floor above.

[sibliis]

if you watch starting 10 minutes of this video, you will realize that how he has focused and explained the concept rather than solving the question that other youtubers are doing. Thanks for this video.

[tusharjajodia]

I can bet,
Only video on YouTube to explain this concept flawlessly.
Most of the Youtuber themselves haven't understood the question

[nikhilsrivastava]

Best explanation ever. Thank you, sir :)
but at 40:22 max of (2, 4) will be 4 and mat[2][7] will become 4.

[Karan.]

I generally do not comment on any video but believe me he is just awesome . He is clearing not only question statement but also the depth of concept involved many famous youtubers have not released a video on this topic Hats off to him

[AmanGupta-kski]

I was struggling for more than 2 days to understand this problem.15 minutes into this video I understood the problem completely. Thank you for this great explanation.

[payalsagar]

His efforts🥺 sir ko pta h ki baache video ko dobara dobara dekh k try kr skte hai lekin still he tries his best by repeating many times

[tejaswinigurram]

best explanation so far, was struggling to understand the intuition, cleared up so well !!

[tushar-nain]

This is the bestest explanation of any problem on youtube.

[harshitgupta]

Why I was not aware of this channel before. The way you teach is awesome. I am really grateful for such awesome videos.

[motivational_dosee]

Sir dimag ka dahi ho gya tha...but now the problem is crystal clear.... thanks ❤️❤️

[kushsharma]

four years of my engineering, never understood this problem till I watched this video. This is gold.

[vidhishah]

This is the best explanation I came across. Watched 4 explanation videos on youtube and this one steals the show. Thank you for sharing this video.

[eziosan]

The way of explanation. Hats off to you 👏 👏 👏

[deepanshu]

Sir this solution is not accepting on leetcode, its time complexity is O(n*n*k) and try to use binary search while checking for egg survives or fails, it will reduce complexity to TC-O(n*k*logn)

[itsme-zs]

wonderful explanation I have found in whole youtube. Thank you so

[binarybeast]

Log code padhaate hai, aapne concept samja diya. Thank you so much. I don't have much subs but will definitely promote you in my videos!

[apurvamilindgaikwad]

And this was exactly what I was looking for! Thank you so much for the wonderful explanation! 😃

[siddharthsahu]

The way you explain dynamic problems is far better than others. Thank you sir😁.

[vedangpandey]

discovering you late but you are a great teacher. you really put the effort in your video. i can see that.

[ranajithore]

Bro you save me.... Hats off. I was having problem Optimal Strategy problems. And you cleared my doubts so well. Kudos man. I generally don't comment. But your efforts forced me to appreciate your work!