Given an integer n, return true if the binary representation of n contains exactly $1$ adjacent pair of set bits ($1$s), and false otherwise.

Constraints:

• $0 \leq$ n $\leq 10^5$

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.