Please enter your email address or userHandle.
Given a string containing 0’s and 1’s. The task is to find out minimum number of bits to be flipped such that 0’s and 1’s will be alternative.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a string.
For each test case, print the minimum number of flipped bits in a new line.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.