Given an integer n, return the maximum distance between two adjacent 1 bits in the binary representation of n.

The distance between two adjacent 1 bits is the number of positions between them in the binary string.

If there are fewer than two 1 bits in the binary representation of n, return 0.

Note: The binary representation does not include leading zeros.

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.