← Questions
Fewest flips to split a binary string into even uniform blocks
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A string of 0s and 1s must be cut into blocks of even length where each block is all 0s or all 1s. Find the fewest bit flips that make this possible, and among those, the fewest blocks.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding