Given a binary circular array nums, you may perform swaps of any two elements in nums. Return the minimum number of swaps needed to make all values equal to 1 appear in a single contiguous block (considering the circular wrap around).

Note: Since nums is circular, a contiguous block of 1s may wrap from the end of the array to the beginning.

Constraints:

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

• nums[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.