You are given a string s of lower case english alphabets. You can choose any two characters in the string and replace all the occurences of the first character with the second character and replace all the occurences of the second character with the first character. Your aim is to find the lexicographically smallest string that can be obtained by doing this operation at most once.
The first line of input contains an integer T, denoting the number of test cases. Then T test cases follow. Each test case contains a string s of lower case English alphabets.
For each test case, in a new line print the lexicographically smallest string that is possible after doing the operation at most once.
1<=length of s<=10000
First Test Case
In ccad, we choose ‘a’ and ‘c’ and after doing the replacement operation once we get, aacd and this is the lexicographically smallest string possible.
Second Test Case
In abba, we can get baab after doing the replacement operation once for ‘a’ and ‘b’ but that is not lexicographically smaller than abba and so the answer is abba.
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.