For a string “qaacde”, This string has two same adjacent characters. So, one possible way to rearrange the string is “qacade”. Now, this string does not have two adjacent characters that are the same.
The first line of input contains a single integer T, representing the number of test cases or queries to be run. Then the T test cases follow. The first line of each test case contains a string S.
For each test case, the output will be “Yes” if you have returned the correct answer, else it will be “No”.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 10 0 <= |S| <= 10^5 Time Limit: 1 sec
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Sort 0s, 1s, 2s