Flip String to Monotone Increasing | Dataford Interview Questions

Flip String to Monotone Increasing (LeetCode 926): minimum flips to make a binary string monotone increasing.

Asked in the phone interview stage.

Input and Output

Implement min_flips_mono_incr(s). Given a non-empty string s containing only 0 and 1, return the minimum number of character flips needed so that all 0s appear before all 1s. A flip changes one character.

Examples: s = "00110" returns 1; s = "010110" returns 2.

Constraints

1 <= len(s) <= 10^5
s contains only the characters '0' and '1'

Function Signature

def min_flips_mono_incr(s):

Your question is Flip String to Monotone Increasing. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem