Maximize K to make all bits equal by flipping substrings of length at least K
Filed under Uber
The question
Given a binary string, you can select any substring of length at least K and invert all its bits. Find the maximum integer K such that the entire string can be made uniform (all 0s or all 1s) through a finite number of operations.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.