Given a string with repeated characters, the task is to complete the function rearrangeString which rearrange characters in a string so that no two adjacent characters are same, and returns 1 if it is possible to transform the string, otherwise 0.
Note : It may be assumed that the string has only lowercase English alphabets and such transformation is always always possible.
Input: str = "aaabc" Output: 1 Explanation: We can transform the string to abaca.
Input: aaabb Output: 1 Explanation: We can transform the string to ababa.
Complete the function rearrangeString() which takes a string as an input parameter and returns 1 if it is possible to transform the string, otherwise returns 0.
Expected Time Complexity: O(N * log N), N = length of string.
Expected Auxiliary Space: O(26)
Custom Input Starts
The first line of input contains an integer T denoting the no of T test cases.Then T test cases follow. The only line of every test case consists of String s.
Custom Input Ends
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.