Max length K of substrings repeatedly flipped to make binary string all 0s
Filed under Uber
The question
Given a binary string of 0s and 1s, find the maximum substring length K such that repeatedly flipping K-length substrings can turn all characters of the string into 0.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.