Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 887. Super Egg Drop
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source