Next higher number in one swap
Submissions: 1022   Accuracy:

17.88%

  Difficulty: Medium
       

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 next higher 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 next higher number possible. if it is not possible to make next higher number then print "-1".

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

Example:
Input:
2

768
333

Output:
786
-1

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

Contributor: Arun Tyagi
Author: arun03


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