Given a positive integer n, consider its binary representation without leading zeros.

Return the minimum number of bit flips required to transform this binary representation into its reversed string. A bit flip involves changing a bit from $0$ to $1$ or from $1$ to $0$.

Constraints:

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

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.