111 is a palindrome, as it is same when reversed.

Also, 
121 is a palindrome.

Similarly, 
131
232
444
505
are palindrome

How to check if a number is palindrome?

From the definition since it is clear that a number is palindrome if it is the same when reversed. So, we simply need to find the reverse of a number and compare it with the original number.

We need to reverse the original number and store it in a temporary variable and then check if the reversed number is equal to the original number then it is palindrome else, not a palindrome number

At first we will store the given number into an temporary variable.
We will reverse the temporary variable.
Now we will check if the reversed number is equal to the given original number.
If the numbers are equal we print Palindrome number else Not Palindrome.

#include <stdio.h>
          

// Solution class
class Solution {
public:
    // Function to check if a number is palindrome
    int palindrome(int n) {
        // Store original number
        int n1 = n;
        int sum = 0;

        // Reverse the number
        while (n1 != 0) {
            int r = n1 % 10;     // Extract last digit
            sum = sum * 10 + r;  // Build reverse number
            n1 /= 10;            // Remove last digit
        }

        // Check if original number equals reversed number
        return n == sum;
    }
};

// Driver code
int main() {
    // Create object of Solution class
    Solution obj;

    // Test number
    int n = 232;

    // Check palindrome
    if (obj.palindrome(n))
        printf("It is a palindrome number");
    else
        printf("It is not a palindrome number");

    return 0;
}

Complexity Analysis

Time Complexity: O(log n),The loop runs once for each digit in the number (number of digits = log10(n)). Each iteration does constant-time operations, so total time = O(log n).

Space Complexity: O(1),Only a fixed number of integer variables are used, so no extra space is required.