← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
You are given k identical eggs and a building with n floors labeled 1 to n. There exists a critical floor c (0 <= c <= n) with the following properties:
Each drop you may choose a floor and drop an egg. If the egg breaks you can no longer use it, but if it does not break you may reuse it in future drops. Your goal is to determine the value of c with the minimum number of moves in the worst case. Return the minimum number of moves required to determine c with certainty.