Search
⌘K
Get Premium
Leetcode 1884. Egg Drop With 2 Eggs and N Floors
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.