Smallest number by rearranging digits of a given number
Submissions: 2067   Accuracy:

38.53%

  Difficulty: Easy   Marks: 2

Find the Smallest number (Not leading Zeros) which can be obtained by rearranging the digits of given number.

Input:

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.

Output:

Print the smallest number which can be made by rearranging the digits of the given number.


Constraints:

1<= T <=100

1<= N <=101000


Example:

Input:

2

846903

55010

Output:

304689

10055

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

Contributor: Sujnesh Mishra
Author: sujnesh


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.