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.