Fewest flips to split a binary string into even uniform blocks
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.
AmazonOnline assessmentNo answer yet. Write the first one; the best answer gets endorsed.