Problem 3922 · Medium

Minimum Flips to Make Binary String Coherent

Track how far the greedy subsequence matches for 011 and 110 at once, keeping the fewest flips for each pair of progress values.

Open the interactive visualisation