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?
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers21
Suggested Problems
-
418 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
575 Solvers
-
Is this triangle right-angled?
5631 Solvers
-
Rounding off numbers to n decimals
4323 Solvers
-
Sum of odd numbers in a matrix
560 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!