You are given an integer array nums containing only $0$’s and $1$’s, and an integer k.

In a single move, you can swap two adjacent elements in nums.

Return the minimum number of moves required to group any k occurrences of $1$ into a contiguous subarray.

Constraints:

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

• nums[i] is equal to $0$ or $1$.

• $1 \leq$ k $\leq$ sum(nums)

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.