Given two integers left and right representing a range of numbers, return the bitwise AND of all integers in the inclusive range from left to right.

Note: The bitwise AND of a range is the result of applying the bitwise AND operation to every number in the range.

Constraints:

• $0 \leq$ left $\leq$ right $\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.