Available question text
Given two identical eggs and n floors, determine the minimum number of drops required in the worst case to find the highest floor from which an egg won't break. The optimal strategy uses progressively smaller step sizes to balance outcomes, and the answer is the smallest m such that m(m+1)/2 ≥ n.
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 1884. Egg Drop With 2 Eggs and N Floors
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source