Flip String to Monotone Increasing

Given a binary string, compute the minimum number of bit flips needed to make it monotone increasing (all 0's then all 1's). The core challenge is choosing the optimal split where you flip ones on the left and zeros on the right, solvable with a single pass using prefix/suffix counts or a simple DP in O(n).