Check if the product of digit sum and its reverse equals the number or not

0 1 5 minutes read

Given a number, check whether the product of digit sum and reverse of digit sum equals the number or not.
Examples:

Input : 1729
Output : Yes
Explanation: 
digit sum = 1 + 7 + 2 + 9
          = 19
Reverse of digit sum = 91
Product = digit sum * Reverse of digit sum
        = 19 * 91
        = 1729

Input : 2334
Output : No

Flowchart:

Approach :
1. Find the sum of digits of a given number.
2. Reverse the digit sum output.
3. Product of digit sum and reverse of digit sum.
If the product equals to the original number then print “Yes” else print “No”.

C++

// CPP implementation to check if the 
// product of digit sum and its  
// reverse equals the number or not 
#include<bits/stdc++.h> 
using namespace std; 
  
// Function that returns number after  
// performing operations. 
int check(int num) 
{ 
    int digitSum = 0; 
      
    // loop used to count digit sum 
    // of numbers. 
    while(num > 0) 
    { 
        digitSum = digitSum + num % 10; 
        num = num / 10; 
    } 
    int temp = digitSum; 
    int reverseDigitSum = 0; 
      
    // loop that reverse digit sum. 
    while(temp > 0) 
    { 
        int rem = temp % 10; 
        reverseDigitSum = reverseDigitSum * 10 
                        + rem; 
        temp = temp / 10; 
    } 
      
    // product of digit sum and reverse digit 
    // sum and assign it to number variables. 
    int number = digitSum * reverseDigitSum; 
    return number; 
} 
  
// Driver function 
int main() 
{ 
    int num = 1729; 
  
    // call check() function. 
    int x = check(num); 
  
    // check if original number equals  
    // to x or not 
    if (num == x) 
        cout << "Yes"; 
    else
        cout << "No"; 
    return 0; 
} 

Java

// JAVA implementation to check if the 
// product of digit sum and its  
// reverse equals the number or not 
import java.io.*; 
public class GFG { 
       
    // Function that returns number after  
    // performing operations. 
    static int check(int num) 
    { 
        int digitSum = 0; 
           
        // loop used to count digit sum 
        // of numbers. 
        while(num > 0) 
        { 
            digitSum = digitSum + num % 10; 
            num = num / 10; 
        } 
        int temp = digitSum; 
        int reverseDigitSum = 0; 
           
        // loop that reverse digit sum. 
        while(temp > 0) 
        { 
            int rem = temp % 10; 
            reverseDigitSum = reverseDigitSum * 10
                            + rem; 
            temp = temp / 10; 
        } 
           
        // product of digit sum and reverse digit 
        // sum and assign it to number variables. 
        int number = digitSum * reverseDigitSum; 
        return number; 
    } 
       
    // Driver function 
    public static void main(String args[]) 
    { 
        int num = 1729; 
       
        // call check() function. 
        int x = check(num); 
       
        // check if original number equals  
        // to x or not 
        if (num == x) 
            System.out.println("Yes"); 
        else
           System.out.println("No"); 
    } 
} 
  
// This code is contributed by Nikita Tiwari 

Python3

# Python implementation to check if the 
# product of digit sum and its  
# reverse equals the number or not 
  
  
# Function that returns number after  
# performing operations. 
def check(num) : 
    digitSum = 0
      
    # loop used to count digit sum 
    # of numbers. 
    while(num != 0) : 
        digitSum = digitSum + num % 10
        num = num // 10
      
    temp = (int)(digitSum) 
    reverseDigitSum = 0
            
    # loop that reverse digit sum. 
    while(temp != 0) : 
        rem = temp % 10
        reverseDigitSum = reverseDigitSum * 10 + rem 
        temp = temp // 10
              
    # product of digit sum and reverse digit 
    # sum and assign it to number variables. 
    number = digitSum * reverseDigitSum 
    return number 
      
# Driver function 
num = 1729
  
# call check() function. 
x = (check(num)) 
  
# check if original number   
# equals to x or not 
if (num == x) : 
    print("Yes") 
else : 
    print("No") 
      
      
# This code is contributed by Nikita Tiwari. 

C#

// Code to check if the product 
// of digit sum and its reverse 
// equals the number or not 
using System; 
  
class GFG { 
  
    // Function that returns number 
    // after performing operations. 
    static int check(int num) 
    { 
        int digitSum = 0; 
  
        // loop used to count digit 
        // sum of numbers. 
        while (num > 0) { 
            digitSum = digitSum + num % 10; 
            num = num / 10; 
        } 
  
        int temp = digitSum; 
        int reverseDigitSum = 0; 
  
        // loop that reverse digit sum. 
        while (temp > 0) { 
            int rem = temp % 10; 
            reverseDigitSum = reverseDigitSum * 10 
                              + rem; 
            temp = temp / 10; 
        } 
  
        // product of digit sum and 
        // reverse digit sum, assign 
        // it to number variables. 
        int number = digitSum * reverseDigitSum; 
        return number; 
    } 
  
    // Driver function 
    public static void Main() 
    { 
        int num = 1729; 
  
        // call check() function. 
        int x = check(num); 
  
        // check if original number 
        // equals to x or not 
        if (num == x) 
            Console.WriteLine("Yes"); 
        else
            Console.WriteLine("No"); 
    } 
} 
  
// This code is contributed by Anant Agarwal. 

PHP

<?php 
// PHP implementation to check if the 
// product of digit sum and its  
// reverse equals the number or not 
  
// Function that returns number   
// after performing operations. 
function check($num) 
{ 
    $digitSum = 0; 
      
    // loop used to count  
    // digit sum of numbers. 
    while($num > 0) 
    { 
        $digitSum = $digitSum +  
                    $num % 10; 
        $num = (int)($num / 10); 
    } 
    $temp = $digitSum; 
    $reverseDigitSum = 0; 
      
    // loop that reverse  
    // digit sum. 
    while($temp > 0) 
    { 
        $rem = $temp % 10; 
        $reverseDigitSum = $reverseDigitSum *  
                                   10 + $rem; 
        $temp = (int)($temp / 10); 
    } 
      
    // product of digit sum  
    // and reverse digit 
    // sum and assign it 
    // to number variables. 
    $number = $digitSum * $reverseDigitSum; 
    return $number; 
} 
  
// Driver Code 
$num = 1729; 
  
// call check() function. 
$x = check($num); 
  
// check if original 
// number equals  
// to x or not 
if ($num == $x) 
echo("Yes"); 
else
    echo("No"); 
  
// This code is contributed by Ajit. 
?> 

Javascript

<script> 
  
      // JavaScript implementation to check if the 
      // product of digit sum and its 
      // reverse equals the number or not 
  
      // Function that returns number after 
      // performing operations. 
      function check(num) 
      { 
        var digitSum = 0; 
  
        // loop used to count digit sum 
        // of numbers. 
        while (num > 0) { 
          digitSum = digitSum + (num % 10); 
          num = parseInt(num / 10); 
        } 
        var temp = digitSum; 
        var reverseDigitSum = 0; 
  
        // loop that reverse digit sum. 
        while (temp > 0) { 
          var rem = temp % 10; 
          reverseDigitSum =  
          reverseDigitSum * 10 + rem; 
          temp = parseInt(temp / 10); 
        } 
  
        // product of digit sum and reverse digit 
        // sum and assign it to number variables. 
        var number = digitSum * reverseDigitSum; 
        return number; 
      } 
  
      // Driver function 
      var num = 1729; 
  
      // call check() function. 
      var x = check(num); 
  
      // check if original number equals 
      // to x or not 
      if (num == x) document.write("Yes"); 
      else document.write("No"); 
        
 </script>

Output

Yes

Time Complexity: O(log₁₀(num))
Auxiliary Space: 1

This article is contributed by Dharmendra Kumar. If you like zambiatek and would like to contribute, you can also write an article using write.zambiatek.com or mail your article to review-team@zambiatek.com. See your article appearing on the zambiatek 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.

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!