Largest number in one swap
Submissions: 1124   Accuracy:

10.32%

  Difficulty: Easy   Marks: 2

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.

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

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

Constraints:
1<=T<=100
2<=|Number length |<=104

Example:
Input:
2

768
333

Output:
867
333

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

Contributor: Arun Tyagi
Author: arun03


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.



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


to report an issue on this page.