Given an integer array nums, return the minimum number of swap operations required to move all $0$’s to the end of the array such that all non zero elements appear before all $0$ elements.

In a single swap operation, you can choose any two indices and swap their values.

Constraints:

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

• $0 \leq$ nums[i] $\leq 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.