Given a binary string s, you may flip any character in s from '0' to '1' or from '1' to '0'. Return the minimum number of flips needed to make s monotone increasing, meaning s can be written as some number of '0' characters followed by some number of '1' characters.

Note: A monotone increasing binary string has no '1' that appears before a '0'.

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.