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.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.