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?
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers24
Suggested Problems
-
4901 Solvers
-
Longest run of consecutive numbers
6825 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
897 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
985 Solvers
-
Is this triangle right-angled?
6692 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!