Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 926. 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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.