Given an integer array nums and an integer target, determine the minimum number of elements that must be removed from nums so that the bitwise XOR sum of the remaining elements is equal to target.

Return the minimum number of removals required. If it is impossible to achieve a bitwise XOR sum equal to target, return $-1$.

Constraints:

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

• $0 \leq$ nums[i] $\leq 10^4$

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