Given an integer array nums and two integers low and high, return the number of pairs $(i, j)$ such that $0 \leq i < j <$ nums.length and low $\leq$ (nums[i] $ ext{ XOR }$ nums[j]) $\leq$ high.

Constraints:

• $1 \leq$ nums.length $\leq 2 imes 10^4$

• $1 \leq$ nums[i] $\leq 2 imes 10^4$

• $1 \leq$ low $\leq$ high $\leq 2 imes 10^4$

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.