Please enter your email address or userHandle.
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
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.