Given an odd number in the form of string, the task is to make largest even number possible from the given number provided one is allowed to do only one swap operation, if no such number is possible then print the input string itself.
Input : 1235785 Output :1535782 Swap 2 and 5.
Thr first line of the input contains a single integer T, denoting the number of test cases. Then T test case follows, the only line of the input contains an odd number in the form of string.
For each test case print the largest possible even number that could be formed by using one swap operation only.
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.