🔴 Riddle #67 of 240
You have three eggs and a 100-storey building. What is the smallest number of drops that guarantees finding the highest survivable floor in the worst case?
Think about it first. When you're ready:
9 drops
With three eggs, d drops cover C(d,1)+C(d,2)+C(d,3) floors: 92 for d = 8 (short of 100) and 129 for d = 9; a dynamic-programming check confirms 9.