Previous number in one swap
Submissions: 1574   Accuracy:

11.46%

  Difficulty: Medium   Marks: 4

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 just previous possible number.

Note:  Leading zeros are not allowed.

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 just previous possible number you can have in one swap. if it is not possible to make previous number then print "-1".

Constraints:
1<=T<=200
2<=|Number length |<=105

Example:
Input:
2

354
999

Output:
345
-1

** 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.