Please enter your email address or userHandle.
Find the Smallest number (Not leading Zeros) which can be obtained by rearranging the digits of given number.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the number N.
Print the smallest number which can be made by rearranging the digits of the given number.
1 <= T <= 100
1 <= N <= 101000
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.