Given a non-negative number N. The task is to apply at most one swap operation on the number N so that the resultant is the smallest possible number.
Note: Input and Output should not contain leading zeros.
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 number N as input.
For each test case, print the smallest number possible. if it is not possible to make smallest number than N then print N as it is.
2<=|Number length |<=105
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.