BETA

Difficulty Level:

Easy

Total Submissions: 799 Accuracy:

27.03%

String Modification (Function Problem)
     

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 that transformed string.

Note : It may be assumed that the string has only lowercase English alphabets and such transformation is always always possible.

Input:
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.

Output:
For each test case output in the expected output will be 1 if the string returned by the function is valid else 0.

 

Constraints:
1<=T<=100
1<=|s|<=100

Example:
Input:

2
aaabc
aaabb
Output:
1
1


 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth, Harshit Sidhwa


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.