Flip Flop
Problem
Deepak like strings which are in flip flop in nature. For example, he likes XYXYX, while he doesn't like XXYX. Now he want to convert every string into a string which he likes. for this, he only delete the character in the string.
Now find the minimum number of delete operation which is required to covert a string that deepak likes.
Input Format :
The first line contains an integer N i.e the number of test cases. Next N lines contain a string each.
Output Format :
For each test case, print the minimum delete operation required.
Constraints :
1 <= N <= 10 1 <= length of String <= 10^5
Time Limit: 5
Memory Limit: 256
Source Limit:
Explanation
XXXX => X, 3 deletions YYYYY => Y, 4 deletions XYXYXYXY => XYXYXYXY, 0 deletions YXYXYXYX => YXYXYXYX, 0 deletions XXXYYY => XY, 4 deletions
Contributers:
shubham
