You start with an integer $1$ and your goal is to reach the integer target.

In a single move, you can perform one of the following actions:

• Increment the current number by $1$.

• Multiply the current number by $2$.

You can perform the multiplication action at most maxDoubles times. There is no limit on the number of increment actions.

Return the minimum number of moves needed to reach target starting from $1$.

Constraints:

• $1 \leq$ target $\leq 10^9$

• $0 \leq$ maxDoubles $\leq 100$

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.