You are given an integer array nums.

Consider all possible triplets of indices $(i, j, k)$ such that $0 \leq i \leq j \leq k <$ nums.length. For each triplet, evaluate the bitwise XOR sum nums[i] ^ nums[j] ^ nums[k].

Return the number of unique XOR values that can be formed.

Constraints:

• $1 \leq$ nums.length $\leq 1500$

• $1 \leq$ nums[i] $\leq 1500$

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.