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

In a single operation, you can choose any element in nums and increment or decrement its value by $1$.

Return the minimum number of operations required to make all elements equal in at least one contiguous subarray of length k.

Constraints:

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

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

• $2 \leq$ k $\leq$ nums.length

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.