BETA

Difficulty Level: Easy

Submissions: 782 Accuracy:

8.06%

Largest number in one swap
     

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

Set Default Code

					   
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.