Given a binary array data, return the minimum number of swaps required to group all $1$’s present in the array together at any position.

Constraints:

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

• data[i] is either $0$ or $1$.

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.