Categories: C++

Find the Reverse of a Number

When a number is reversed, the digits are rearranged in reverse order, starting with the last digit, then the second-to-last digit, and so on, with the first digit appearing last.

Program Code:

#include <iostream>
using namespace std;

/* Iterative function to reverse digits of num*/int reverseDigits(int num)
{
 int rev = 0;
 while (num > 0) {
  rev = rev * 10 + num % 10;
  num = num / 10;
 }
 return rev;
}

/*Driver program to test reverseDigits*/int main()
{
 int num ;
 cin>> num;
    cout<<"Reverse of no. is " << reverseDigits(num);

 getchar();
 return 0;
}

Output:

45821
Reverse of no. is12854

Note: also read about Armstrong Number in C++

Follow Me

Please follow me to read my latest post on programming and technology if you like my post.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Share
Published by
Rabecca Fatima

Recent Posts

Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java

Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…

3 months ago

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

2 years ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

2 years ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

2 years ago