3922. Minimum Flips to Make Binary String Coherent

You are given a binary string s.

A string is considered coherent if it does not contain "011" or "110" as subsequences.

In one operation, you can flip any character in s ('0' to '1' or '1' to '0').

Return an integer denoting the minimum number of modifications required to make s coherent.

A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

Example 1:

Example 2:

Example 3:

Constraints:

• 1 <= s.length <= 105
• s[i] is either '0' or '1'.