Ishaan is playing with strings these days. He has found a new string. He wants to modify it as per the following rules :
First line of input contains a single integer T denoting the number of test cases.
The only line of each test case contains a string S consisting of lowercase English Alphabets.
For each test case, in a new line, print the required answer in a new line.
This is a function problem. You only need to complete the function modified that returns the answer.
1 <= T <= 200
1 <= Length of S <= 103
Case 1 :
3 b's occur consecutively, we add a 'd',
Case 2 :
5 a's occur consecutively, we need to add 2 'b',
Case 3 :
No character occurs 3 times, so no need to add anything.
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.