Minimum number of flipped bits
Submissions: 4688   Accuracy:

27.94%

  Difficulty: Basic   Marks: 1

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.

Input:
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.

Output:
For each test case, print the minimum number of flipped bits in a new line.

Constraints:
1<=T<=100
1<=|string length|<=104

Example:
Input:
2
0011
011000

Output:
2
3

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Arun Tyagi
Author: arun03


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.