You are given a binary string s. In a single operation, you can flip any character in s from '$0$' to '$1$' or from '$1$' to '$0$'.

A string is defined as coherent if it does not contain "$011$" or "$110$" as a subsequence.

Return the minimum number of flips required to make s coherent.

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.