Problem 44713. The Google Interview: Two Eggs Problem

Consider the following problem, a popular Google interview question:

A firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building of n floors from which such an egg can fall without breaking. The firm has given a tester two identical eggs to experiment with. The same egg can be dropped multiple times unless it breaks.

For a n floor story building, what is the minimum number of droppings d that is guaranteed to determine the highest safe floor in all cases?

Solve

Solution Stats

36.56% Correct | 63.44% Incorrect
Last Solution submitted on Jan 12, 2026

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers21

Suggested Problems

More from this Author18

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!