VOOZH about

URL: https://www.geeksforgeeks.org/dsa/write-a-program-to-reverse-digits-of-a-number/

⇱ Reverse Digits of a Number - GeeksforGeeks


  • Courses
  • Tutorials
  • Interview Prep

Reverse Digits of a Number

Last Updated : 3 Apr, 2026

Given an Integer n, find the reverse of its digits.

Examples:

Input: n = 122
Output: 221
Explanation: By reversing the digits of number, number will change into 221.

Input: n = 200
Output: 2
Explanation: By reversing the digits of number, number will change into 2.

Input: n = 12345
Output: 54321
Explanation: By reversing the digits of number, number will change into 54321.

Reversing Digit by Digit

This idea for this approach is to repeatedly extract the last digit of n using the modulus operator (n % 10) and appending it to the reverse number (revNum). After extracting the digit, the number n is reduced by dividing it by 10 (n = n / 10). This process continues until n becomes 0. Finally, the reversed number (revNum) is returned.


Output
2654

Time Complexity - O(log n)
Space Complexity - O(1)

Using String

This approach reverses a number by converting it into a string, reversing the string, and then converting it back into an integer. This avoids manual digit manipulation by leveraging string operations. The string reversal is done using a built-in function, and the result is then converted back to an integer and returned. This method is straightforward but requires extra space for the string conversion.


Output
2654

Time Complexity - O(log n)
Space Complexity - O(1)

Note: The above program doesn't consider leading zeroes. For example, for 100 programs will print 1. If you want to print 001

Using String and Slicing in Python

The approach used is "Using Slicing". This technique involves converting the number into a string, then reversing that string by using slicing operations. After reversing, the string is converted back into a number. This method is simple and efficient but requires additional space for storing the string representation of the number.


Output
2654

Time Complexity - O(n)
Space Complexity - O(n)

Comment