Egg Dropping Problem Dynamic Programming | Leetcode Hard Solutions

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.

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.

To attempt and to submit this question, click here: https://www.pepcoding.com/resources/data-structures-and-algorithms-in-java-levelup/dynamic-programming/egg-drop-official/ojquestion

For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation

Have a look at our result: https://www.pepcoding.com/placements
Follow us on our FB page: https://www.facebook.com/pepcoding
Follow us on Instagram: https://www.instagram.com/pepcoding
Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education