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

In one operation, you can choose any element in nums and increase or decrease it by $1$.

The array nums is considered modulo alternating if there exist two distinct integers $x$ and $y$ such that $0 \le x, y < k$ and:

• nums[i] % k is equal to $x$ for all even indices $i$.

• nums[i] % k is equal to $y$ for all odd indices $i$.

Return the minimum number of operations required to make nums modulo alternating.

Constraints:

• $1 \le$ nums.length $\le 100$

• $1 \le$ nums[i] $\le 10^9$

• $2 \le$ k $\le 100$

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.