You are given a string “S”. Your task is to rearrange the characters of a string “S”, such that it does not contain any two adjacent characters which are the same.
If it is possible to rearrange the string “S”, then print any possible arrangement. else, print “not possible” without quotes.
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.
Input format :
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.
Output format :
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
In this approach, we will generate all the possible rearrangements of the string and check if the current string in our rearrangement does not have any two adjacent characters that are the same. If we can find any string which satisfies our criteria then we will return that string else we will return “not possible”.
We can implement the above approach by –
- Generate all permutations of a string.
- For each permutation check if this permutation does not have two characters that are the same, if yes then we will return the current permutation else we will move to the next permutation.
- If we are not able to find any valid arrangement, then we will return “not possible”.