You are given a $0$ indexed integer array nums and a non negative integer k.

In one operation, you can select any element from the array and flip any single bit in its binary representation. Flipping a bit changes a $0$ to a $1$ or a $1$ to a $0$.

Return the minimum number of operations required to make the bitwise XOR of all elements in nums equal to k.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

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

• $0 \leq$ k $\leq 10^6$

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.