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 Solvers22
Suggested Problems
-
Select every other element of a vector
36748 Solvers
-
1668 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
560 Solvers
-
318 Solvers
-
Create a vector whose elements depend on the previous element
794 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!
