Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Smallest number by rearranging digits of a given number

  • Difficulty Level : Medium
  • Last Updated : 25 Jan, 2022

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

Examples: 

Input: n = 846903
Output: 304689

Input: n = 55010
Output: 10055

Input: n = -40505
Output: -55400

Steps to find the smallest number.  

  1. Count the frequency of each digit in the number.
  2. If it is a non-negative number then
    1. Place the smallest digit (except 0) at the left most of the required number. 
      and decrement the frequency of that digit by 1.
    2. Place all remaining digits in ascending order from left to right.
  3. Else if it is a negative number then
    1. Place the largest digit at the left most of the required number. and decrement the frequency of that digit by 1.
    2. Place all remaining digits in descending order from right to left.

This solution is based on counting sort. 

C++




// C++ program for finding smallest number
// from digits of given number
#include<iostream>
using namespace std;
 
// function to find the smallest number
int smallest(int num)
{
    // initialize frequency of each digit to Zero
    int freq[10] = {0};
     
      // Checking Number is positive or Negative
    bool is_pos = (num>0);
   
      // Getting the absolute value of num
    num = abs(num);
   
    // count frequency of each digit in the number
    while (num)
    {
        int d = num % 10; // extract last digit
        freq[d]++; // increment counting
        num = num / 10; //remove last digit
    }
     
    int result = 0;
   
      // If it is positive Number then it should be smallest
      if(is_pos)
    {
      // Set the Leftmost digit to minimum except 0
      for (int i = 1 ; i <= 9 ; i++)
      {
          if (freq[i])
          {
              result = i;
              freq[i]--;
              break;
          }
      }
 
      // arrange all remaining digits
      // in ascending order
      for (int i = 0 ; i <= 9 ; i++)
          while (freq[i]--)
              result = result * 10 + i;
    }
    else  // If negative then number should be Largest
    {
      // Set the Leftmost digit to maximum
      for (int i = 9 ; i >= 1 ; i--)
      {
         if (freq[i])
         {
            result = i;
            freq[i]--;
            break;
         }
      }
       
      // arrange all remaining digits
      // in descending order
      for (int i = 9 ; i >=0 ; i--)
         while (freq[i]--)
            result = result * 10 + i;
 
      // Negative number should be returned here
      result = -result;
    }
    return result;
}
 
// Driver Program
int main()
{
    int num = 570107;
    cout << smallest(num) << endl;
   
    int num2 = -691005;
    cout << smallest(num2);
    return 0;
}
Java



import java.lang.Math;
 
// Java program for finding smallest number
// from digits of given number
public class GFG {
 
    // function to find the smallest number
    static int smallest(int num)
    {
        // initialize frequency of each digit to Zero
        int[] freq = new int[10];
      
           // Checking Number is positive or Negative
        boolean is_pos = (num>0);
       
          // Getting the absolute value of num
        num = Math.abs(num);
       
        // count frequency of each digit in the number
        while (num > 0)
        {
            int d = num % 10; // extract last digit
            freq[d]++; // increment counting
            num = num / 10; //remove last digit
        }
      
       int result = 0;
   
          // If it is positive Number then it should be smallest
          if(is_pos)
        {
            // Set the LEFTMOST digit to minimum expect 0
            for (int i = 1 ; i <= 9 ; i++)
            {
                    if (freq[i] != 0)
                {
                        result = i;
                        freq[i]--;
                    break;
                }
            }
      
            // arrange all remaining digits
            // in ascending order
            for (int i = 0 ; i <= 9 ; i++)
                while (freq[i]-- != 0)
                    result = result * 10 + i;
         }
          else  // If negative then number should be Largest
        {
          // Set the Rightmost digit to maximum
          for (int i = 9 ; i >= 1 ; i--)
          {
             if (freq[i] !=0)
             {
                result = i;
                freq[i]--;
                break;
             }
          }
 
          // arrange all remaining digits
          // in descending order
          for (int i = 9 ; i >=0 ; i--)
             while (freq[i]-- != 0)
                result = result * 10 + i;
 
          // Negative number should be returned here
          result = -result;
        }
        return result;
    }
      
    // Driver Program
    public static void main(String args[])
    {
        int num = 570107;
        System.out.println(smallest(num));
         
        int num2 = -691005;
        System.out.println(smallest(num2));
    }
}
// This code is contributed by Sumit Ghosh
Python3



# Function to find the smallest number
def smallest(lst):
     
    # Here i is index and n is the number of the list
    for i,n in enumerate(lst):
         
        # Checking for the first non-zero digit in the sorted list
        if n != '0':
             
            # Remove and store the digit from the lst
            tmp = lst.pop(i)
            break
     
    # Place the first non-zero digit at the starting
    # and return the final number
    return str(tmp) + ''.join(lst)
 
 
# Driver program
if __name__ == '__main__':
     
    # Converting the given numbers into string to form a list
    lst = list(str(570107))
    lst.sort()
     
    # Calling the function using the above list
    print (smallest(lst))
     
# This code is contributed by Mahendra Yadav
C#



// C# program for finding smallest
// number from digits of given
// number
using System;
 
public class GFG {
 
    // function to find the smallest
    // number
    static int smallest(int num)
    {
         
        // initialize frequency of
        // each digit to Zero
        int[] freq = new int[10];
     
        // count frequency of each
        // digit in the number
        while (num > 0)
        {
             
            // extract last digit
            int d = num % 10;
             
            // increment counting
            freq[d]++;
             
            //remove last digit
            num = num / 10;
        }
     
        // Set the LEFTMOST digit to
        // minimum expect 0
        int result = 0;
        for (int i = 1 ; i <= 9 ; i++)
        {
            if (freq[i] != 0)
            {
                result = i;
                freq[i]--;
                break;
            }
        }
     
        // arrange all remaining digits
        // in ascending order
        for (int i = 0 ; i <= 9 ; i++)
            while (freq[i]-- != 0)
                result = result * 10 + i;
     
        return result;
    }
     
    // Driver Program
    public static void Main()
    {
        int num = 570107;
        Console.WriteLine(smallest(num));
    }
}
 
// This code is contributed by anuj_67.
PHP



<?php
// PHP program for finding smallest
// number from digits of given number
 
// function to find the smallest number
function smallest($num)
{
    // initialize frequency of
    // each digit to Zero
    $freq = array_fill(0, 10, 0);
 
    // count frequency of each
    // digit in the number
    while ($num)
    {
        $d = $num % 10; // extract last digit
        $freq[$d]++; // increment counting
        $num = (int)($num / 10); // remove last digit
    }
 
    // Set the LEFTMOST digit
    // to minimum expect 0
    $result = 0;
    for ($i = 1 ; $i <= 9 ; $i++)
    {
        if ($freq[$i])
        {
            $result = $i;
            $freq[$i]--;
            break;
        }
    }
 
    // arrange all remaining digits
    // in ascending order
    for ($i = 0 ; $i <= 9 ; $i++)
        while ($freq[$i] > 0)
        {
            $result = $result * 10 + $i;
            $freq[$i] -= 1;
        }
 
    return $result;
}
 
// Driver Code
$num = 570107;
echo smallest($num);
 
// This code is contributed by mits
?>
Javascript



<script>
 
// Javascript program for finding smallest number
// from digits of given number
 
// function to find the smallest number
function smallest(num)
{
    // initialize frequency of each digit to Zero
    var freq = Array(10).fill(0);
 
    // count frequency of each digit in the number
    while (num)
    {
        var d = num % 10; // extract last digit
        freq[d]++; // increment counting
        num = parseInt(num / 10); //remove last digit
    }
 
    // Set the LEFTMOST digit to minimum expect 0
    var result = 0;
    for (var i = 1 ; i <= 9 ; i++)
    {
        if (freq[i])
        {
            result = i;
            freq[i]--;
            break;
        }
    }
 
    // arrange all remaining digits
    // in ascending order
    for (var i = 0 ; i <= 9 ; i++)
        while (freq[i]--)
            result = result * 10 + i;
 
    return result;
}
 
// Driver Program
var num = 570107;
document.write(smallest(num));
 
// This code is contributed by rutvik_56.
</script>
Output
100577
-965100
Another Approach:Find smallest permutation of given number
This article is contributed by Ajay Kumar Agrahari(aJy aGr). If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 

My Personal Notes
arrow_drop_up
Previous
Find smallest permutation of given number
Next

Smallest number k such that the product of digits of k is equal to n
Recommended Articles
Page :
Largest number by rearranging digits of a given positive or negative number
09, Feb 22
Find smallest number with given number of digits and sum of digits under given constraints
26, Jan 20
Minimum difference possible between two given numbers by rearranging their digits in the same order
07, May 21
Largest number not greater than N which can become prime after rearranging its digits
18, Apr 19
Find smallest number with given number of digits and sum of digits
06, Jun 16
Smallest number with given sum of digits and sum of square of digits
14, Jun 18
Find smallest number with given digits and sum of digits
10, Aug 21
Smallest positive number made up of non-repeating digits whose sum of digits is N
17, Dec 20
Split given Array in minimum number of subarrays such that rearranging the order of subarrays sorts the array
03, Sep 21
Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
31, Jan 19
Minimum digits to be removed to make either all digits or alternating digits same
15, Aug 20
Largest palindromic string possible from given strings by rearranging the characters
23, Aug 20
Length of longest common prefix possible by rearranging strings in a given array
16, Oct 20
Largest Roman Numeral possible by rearranging characters of a given string
10, Mar 21
Maximize the sum of modified values after rearranging given array based on condition array
25, Oct 21
Maximise distance by rearranging all duplicates at same distance in given Array
16, Feb 22
Maximize the given number by replacing a segment of digits with the alternate digits given
30, Apr 19
Find the smallest number whose digits multiply to a given number n
09, Jun 14
Get the kth smallest number using the digits of the given number
16, Jul 17
Immediate smallest number after re-arranging the digits of a given number
11, Nov 18
Smallest odd number with even sum of digits from the given number N
28, Feb 20
Find smallest possible Number from a given large Number with same count of digits
28, Feb 20
Find smallest number formed by inverting digits of given number N
28, Jul 20
Find the Largest number with given number of digits and sum of digits
06, Jun 16
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!