Given a non-negative number N in the form of string. The task is to apply at most one swap operation on the number N so that the resultant is the largest possible number.
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 largest number possible. if it is not possible to make largest number than N then print N as it is.
2<=|Number length |<=104
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.