You are given a binary string s. In one second, every occurrence of "01" is simultaneously replaced with "10". This process repeats until no occurrences of "01" remain in s.

Return the number of seconds required to complete this process.

Constraints:

• $1 \leq$ s.length $\leq 1000$

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