Given an integer n, return the total number of integers $k$ in the range $[0,$ n$]$ such that the binary representation of $k$ without leading zeros is a palindrome.

Note: The binary representation of $0$ is $ ext{“}0 ext{”}$.

Constraints:

• $0 \leq$ n $\leq 10^{15}$

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.