Given a positive integer n, you can perform one of the following operations:

• If n is even, replace n with n $/$ $2$.

• If n is odd, replace n with either n $+$ $1$ or n $-$ $1$.

Return the minimum number of operations required for n to become $1$.

Constraints:

• $1 \leq$ n $\leq 2^{31} - 1$

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.