You are given k identical eggs and a building with n floors numbered from $1$ to n.

There exists a floor f satisfying $0 \leq$ f $\leq$ n such that:

• Any egg dropped from a floor strictly higher than f will break.

• Any egg dropped from floor f or below will not break.

In each move, you can choose any floor x where $1 \leq$ x $\leq$ n and drop an unbroken egg from it. If the egg breaks, you can no longer use it. If the egg does not break, you can reuse it in future moves.

Return the minimum number of moves required to determine the exact value of f with certainty under the worst case scenario.

Constraints:

• $1 \leq$ k $\leq 100$

• $1 \leq$ n $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.