You are given an integer array nums and an integer k.

The bitwise $ ext{XOR}$ of a contiguous segment of length k is the bitwise $ ext{XOR}$ of all elements in that segment.

Return the minimum number of elements you need to modify in nums such that the bitwise $ ext{XOR}$ of every contiguous segment of length k is equal to $0$.

Constraints:

• $1 \leq$ k $\leq$ nums.length $\leq 2000$

• $0 \leq$ nums[i] $< 2^{10}$

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.