Reverse an Integer and Check for Palindrome

Given an integer N, extract its digits from right to left using modulo arithmetic to construct its reverse number, and verify whether the original number equals its reverse (Palindrome check).

Step 1: Start.
Step 2: Read integer N.
Step 3: Set orig = N, rev = 0.
Step 4: If N < 0, set temp = -N; Else temp = N.
Step 5: While (temp > 0):
         rem = temp % 10
         rev = (rev * 10) + rem
         temp = temp / 10
Step 6: Print 'Reversed Number:', rev.
Step 7: If (N >= 0 and orig == rev):
         Print 'It is a Palindrome Number.'
Step 8: Else:
         Print 'It is NOT a Palindrome Number.'
Step 9: Stop.

         +-----------------+
         |     [ START ]   |
         +-----------------+
                  |
                  v
         +-----------------+
         |     Read N      |
         +-----------------+
                  |
                  v
         +-----------------+
         | orig = N, rev = 0|
         | temp = abs(N)   |
         +-----------------+
                  |
                  v
               /     \
             / temp > 0?\ ---NO---> [Print rev]
             \         /                 |
                  | YES                  v
                  v                   /     \
         +-----------------+        /orig==rev?\
         | rem = temp % 10 |        \         /
         | rev = rev*10+rem|       YES/     \NO
         | temp = temp / 10|         v       v
         +-----------------+     [Palin]  [Not Palin]
                  |                  |        |
                  +------>           +----+---+
                                          |
                                          v
                                       [STOP]

Edit the code directly with the Edit Code button, provide custom inputs, and press Run Code to compile and execute in the live terminal console below!

#include <iostream>
using namespace std;

int main() {
    long long n;
    cout << "Enter an integer: ";
    if (!(cin >> n)) {
        cout << "Invalid input! Please enter an integer.\n";
        return 1;
    }

    long long original = n;
    long long temp = (n < 0) ? -n : n;
    long long reversed = 0;

    while (temp > 0) {
        long long rem = temp % 10;
        reversed = (reversed * 10) + rem;
        temp /= 10;
    }

    cout << "\nOriginal Value : " << original << "\n";
    cout << "Reversed Value : " << reversed << "\n";

    if (n >= 0 && original == reversed) {
        cout << "Result         : " << original << " is a PALINDROME number.\n";
    } else {
        cout << "Result         : " << original << " is NOT a palindrome number.\n";
    }

    return 0;
}

Input:
12321

Output:
Original Value : 12321
Reversed Value : 12321
Result         : 12321 is a PALINDROME number.