Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Reverse and Add Function

  • Difficulty Level : Basic
  • Last Updated : 22 Jan, 2022

The reverse and add function starts with a number, reverses its digits, and adds the reverse to the original. If the sum is not a palindrome, repeat this procedure until it does. 

Write a program that takes number and gives the resulting palindrome (if one exists). If it took more than 1,000 iterations (additions) or yield a palindrome that is greater than 4,294,967,295, assume that no palindrome exist for the given number.

Examples: 

Input : 195
Output : 9339

Input : 265
Output: 45254

Input : 196
Output : No palindrome exist

C++




// C++ Program to implement reverse and add function
#include<bits/stdc++.h>
using namespace std;
 
/* Iterative function to reverse digits of num*/
long long reversDigits(long long num)
{
    long long rev_num = 0;
    while (num > 0)
    {
        rev_num = rev_num*10 + num%10;
        num = num/10;
    }
    return rev_num;
}
 
/* Function to check whether he number is palindrome or not */
bool isPalindrome(long long num)
{
    return (reversDigits(num) == num);
}
 
/* Reverse and Add Function */
void ReverseandAdd(long long num)
{
    long long rev_num=0;
    while (num <= 4294967295)
    {
        // Reversing the digits of the number
        rev_num = reversDigits(num);
 
        // Adding the reversed number with the original
        num = num + rev_num;
 
        // Checking whether the number is palindrome or not
        if (isPalindrome(num))
        {
            printf("%lld\n",num);
            break;
        }
        else if (num > 4294967295)
        {
            printf("No palindrome exist");
        }
    }
}
 
// Driver Program
int main()
{
    ReverseandAdd(195);
    ReverseandAdd(265);
    return 0;
}
Java



// Java Program to implement reverse and add function
public class ReverseAdd
{
    /* Iterative function to reverse digits of num*/
    long reversDigits(long num)
    {
        long rev_num = 0;
        while (num > 0)
        {
            rev_num = rev_num*10 + num%10;
            num = num/10;
        }
        return rev_num;
    }
 
    /* Function to check whether he number is
           palindrome or not */
    boolean isPalindrome(long num)
    {
        return (reversDigits(num) == num);
    }
 
    /* Reverse and Add Function */
    void ReverseandAdd(long num)
    {
        long rev_num = 0;
        while (num <= 4294967295l)
        {
            // Reversing the digits of the number
            rev_num = reversDigits(num);
 
            // Adding the reversed number with the original
            num = num + rev_num;
 
            // Checking whether the number is palindrome or not
            if(isPalindrome(num))
            {
                System.out.println(num);
                break;
            }
            else if (num > 4294967295l)
            {
                System.out.println("No palindrome exist");
            }
        }
    }
     
    // Main method
    public static void main(String[] args)
    {
        ReverseAdd ob = new ReverseAdd();
        ob.ReverseandAdd(195l);
        ob.ReverseandAdd(265l);
         
    }
}
Python3



#Python Program to implement reverse and add function
 
# Iterative function to reverse digits of num
def reversDigits(num):
    rev_num=0
    while (num > 0):
        rev_num = rev_num*10 + num%10
        num = num//10
    return rev_num
 
# Function to check whether the number is palindrome or not
def isPalindrome(num):
    return (reversDigits(num) == num)
 
# Reverse and Add Function
def ReverseandAdd(num):
    rev_num = 0
    while (num <= 4294967295):
        # Reversing the digits of the number
        rev_num = reversDigits(num)
 
        # Adding the reversed number with the original
        num = num + rev_num
 
        # Checking whether the number is palindrome or not
        if(isPalindrome(num)):
            print (num)
            break
        else:
            if (num > 4294967295):
                print ("No palindrome exist")
 
# Driver Code
ReverseandAdd(195)
ReverseandAdd(265)
C#



// C# Program to implement reverse and add function
using System;
 
class GFG
{
    /* Iterative function to reverse digits of num*/
    static long reversDigits(long num)
    {
        long rev_num = 0;
        while (num > 0)
        {
            rev_num = rev_num * 10 + num % 10;
            num = num / 10;
        }
        return rev_num;
    }
 
    /* Function to check whether he number is
        palindrome or not */
    static bool isPalindrome(long num)
    {
        return (reversDigits(num) == num);
    }
 
    /* Reverse and Add Function */
    static void ReverseandAdd(long num)
    {
        long rev_num = 0;
        while (num <= 4294967295)
        {
            // Reversing the digits of the number
            rev_num = reversDigits(num);
 
            // Adding the reversed number with the original
            num = num + rev_num;
 
            // Checking whether the number is palindrome or not
            if(isPalindrome(num))
            {
                Console.WriteLine(num);
                break;
            }
            else if (num > 4294967295)
            {
                Console.WriteLine("No palindrome exist");
            }
        }
    }
     
    // Driver code
    public static void Main()
    {
        ReverseandAdd(195);
        ReverseandAdd(265);
    }
}
 
// This code is contributed by chandan_jnu
PHP



<?php
// PHP Program to implement reverse and add function
 
/* Iterative function to reverse digits of num*/
function reversDigits($num)
{
    $rev_num = 0;
    while ($num > 0)
    {
        $rev_num = $rev_num * 10 + $num % 10;
        $num = (int)($num / 10);
    }
    return $rev_num;
}
 
/* Function to check whether he number
   is palindrome or not */
function isPalindrome($num)
{
    return (reversDigits($num) == $num);
}
 
/* Reverse and Add Function */
function ReverseandAdd($num)
{
     $rev_num = 0;
    while ($num <= 4294967295)
    {
        // Reversing the digits of the number
        $rev_num = reversDigits($num);
 
        // Adding the reversed number with
        // the original
        $num = $num + $rev_num;
 
        // Checking whether the number is
        // palindrome or not
        if (isPalindrome($num))
        {
            print($num . "\n");
            break;
        }
        else if ($num > 4294967295)
        {
            print("No palindrome exist");
        }
    }
}
 
// Driver Code
ReverseandAdd(195);
ReverseandAdd(265);
 
// This code is contributed by chandan_jnu
?>
Javascript



<script>
 
// Javascript program to implement
// reverse and add function
 
// Iterative function to reverse digits of num
function reversDigits(num)
{
    let rev_num = 0;
    while (num > 0)
    {
        rev_num = rev_num * 10 + num % 10;
        num = parseInt(num / 10, 10);
    }
    return rev_num;
}
 
// Function to check whether he number
// is palindrome or not
function isPalindrome(num)
{
    return(reversDigits(num) == num);
}
 
// Reverse and Add Function
function ReverseandAdd(num)
{
    let rev_num = 0;
     
    while (num <= 4294967295)
    {
         
        // Reversing the digits of the number
        rev_num = reversDigits(num);
 
        // Adding the reversed number
        // with the original
        num = num + rev_num;
 
        // Checking whether the number
        // is palindrome or not
        if (isPalindrome(num))
        {
            document.write(num + "</br>");
            break;
        }
        else if (num > 4294967295)
        {
            document.write("No palindrome exist" +
                           "</br>");
        }
    }
}
 
// Driver code
ReverseandAdd(195);
ReverseandAdd(265);
 
// This code is contributed by rameshtravel07 
 
</script>
Output: 
9339
45254
References: https://app.assembla.com/spaces/AASU_Fall2008_ProgrammingTeam/wiki
This article is contributed by Rahul Agrawal. 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
Next

Find minimum number of coins that make a given value
Recommended Articles
Page :
Count of unique pairs (i, j) in an array such that sum of A[i] and reverse of A[j] is equal to sum of reverse of A[i] and A[j]
12, Feb 21
Add index to characters and reverse the string
24, Dec 18
Reverse every word of the string except the first and the last character
29, Aug 19
Count number of common elements between a sorted array and a reverse sorted array
12, May 21
Absolute difference between the count of set bits in N and its reverse
30, Mar 21
Find N numbers such that a number and its reverse are divisible by sum of its digits
06, May 20
Reverse the rows and columns of a matrix alternatively
22, Dec 21
Given a linked list, reverse alternate nodes and append at the end
18, Feb 14
Count ways to divide C in two parts and add to A and B to make A strictly greater than B
10, Apr 20
Write a program to reverse digits of a number
30, May 09
Write an Efficient C Program to Reverse Bits of a Number
02, Aug 09
Reverse a string without affecting special characters
27, Oct 15
Different methods to reverse a string in C/C++
20, Apr 16
Reverse an array in groups of given size | Set 2 (Variations of Set 1 )
23, Aug 16
Reverse an array upto a given position
09, Aug 15
Reverse a Linked List according to its Size
12, Jun 18
Reverse a number using stack
01, Aug 17
Reverse first K elements of given linked list
18, Dec 17
Print Reverse a linked list using Stack
20, Dec 17
Reverse a Doubly Linked List | Set 4 (Swapping Data)
26, Dec 17
PHP | Reverse a String
31, Dec 17
Python List reverse()
12, Jan 18
Counting numbers whose difference from reverse is a product of k
17, Jan 18
Program to copy the contents of one array into another in the reverse order
14, Jan 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Basic





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!