Leetcode 887. Super Egg Drop
Given k eggs and an n-floor building, find the minimum number of drops required in the worst case to determine the highest floor f from which eggs won't break—balancing the two outcomes (egg breaks vs survives) at each drop. This is a classic DP/optimization problem solved by reasoning about how many floors can be checked with m moves and k eggs (using the recurrence that combines the break and survive cases) to binary-search or iterate for the minimal m.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.