You are given a binary string s.

You can perform the following operation on the string any number of times:

Choose an index i such that s[i] is equal to '$1$' and s[i + 1] is equal to '$0$'. Move the character at index i to the right until it reaches either another character '$1$' or the end of the string.

Return the maximum number of operations you can perform.

Constraints:

• $1 \leq$ 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.