You are given a $0$ indexed binary string s of length n, where '$1$' represents a black ball and '$0$' represents a white ball.

In each step, you may choose two adjacent balls and swap them.

Return the minimum number of steps required to group all the black balls to the right and all the white balls to the left.

Constraints:

• $1 \leq$ n $=$ s.length $\leq 10^5$

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