{"id":469,"date":"2024-01-04T09:44:15","date_gmt":"2024-01-04T09:44:15","guid":{"rendered":"https:\/\/www.kaashivinfotech.com\/blog\/?p=469"},"modified":"2025-07-16T08:28:14","modified_gmt":"2025-07-16T08:28:14","slug":"palindrome-number-in-c-java-and-python","status":"publish","type":"post","link":"https:\/\/www.kaashivinfotech.com\/blog\/palindrome-number-in-c-java-and-python\/","title":{"rendered":"Palindrome Number in C, Java, and Python"},"content":{"rendered":"

Introduction<\/strong><\/h2>\n

A palindrome number is a positive integer that remains the same when its digits are reversed. In other words, it reads the same forwards and backwards. For example, the numbers 121, 1331, and 4554 are palindrome numbers because they read the same regardless of the direction, while the numbers 123, 456, and 789 are not palindrome numbers.<\/p>\n

Problem Statement<\/strong><\/h2>\n

Problem Statement –\u00a0 Palindrome Number<\/p>\n

A palindrome number is a number that reads the same backward as forward. Given an integer, determine whether it is a palindrome or not.<\/p>\n

Write a program or function that takes an integer as input and returns true if it is a palindrome number, and false otherwise.<\/p>\n

\"\"<\/p>\n

Example<\/strong><\/h2>\n

1.Input –\u00a0 121<\/p>\n

Output –\u00a0 true (121 is a palindrome number)<\/p>\n

2.Input – 12321<\/p>\n

Output –\u00a0 true (12321 is a palindrome number)<\/p>\n

3.Input –\u00a0 12345<\/p>\n

Output –\u00a0 false (12345 is not a palindrome number)<\/p>\n

 <\/p>\n

The formula to check if a positive integer is a palindrome involves reversing the digits of the number and comparing it with the original number. Here’s the formula in mathematical notation<\/p>\n

Let (n) be the original positive integer.<\/p>\n

Let (rev) be the number obtained by reversing the digits of (n).<\/p>\n

If (n = rev), then the integer (n) is a palindrome.<\/p>\n

Let’s go through an example using the number 121<\/p>\n

Example<\/strong><\/h2>\n

Original number – (n = 121)<\/p>\n

Reversed number – (rev = 121)<\/p>\n

Since (n = rev), the number 121 is a palindrome.<\/p>\n

Similarly, let’s take an example where the number is not a palindrome, like 123<\/p>\n

Example<\/strong><\/h2>\n

Original number –\u00a0 (n = 123)<\/p>\n

Reversed number –\u00a0 (rev = 321)<\/p>\n

Since (n \u2260 rev), the number 123 is not a palindrome<\/a>.<\/p>\n

In code, this formula is implemented by extracting digits from the original number, reversing them, and then comparing the reversed number with the original number, as shown in the solutions provided earlier for C, Java, and Python.<\/p>\n

Let’s do a dry run of the palindrome check approach using the example number 12321.<\/p>\n

Example<\/strong><\/h2>\n

Number – 12321<\/p>\n

Step 1 –\u00a0 Initialize variables.<\/strong><\/h3>\n

num = 12321<\/p>\n

original = 12321<\/p>\n

reversed = 0<\/p>\n

Step 2 –\u00a0 Reverse the digits.<\/strong><\/h3>\n

Extract last digit –\u00a0 1<\/u><\/p>\n

reversed = (reversed * 10) + 1 = 0 + 1 = 1<\/p>\n

num = num \/\/ 10 = 1232<\/p>\n

Extract last digit – 2<\/u><\/p>\n

reversed = (reversed * 10) + 2 = 1 * 10 + 2 = 12<\/p>\n

num = num \/\/ 10 = 123<\/p>\n

Extract last digit – 3<\/u><\/p>\n

reversed = (reversed * 10) + 3 = 12 * 10 + 3 = 123<\/p>\n

num = num \/\/ 10 = 12<\/p>\n

Extract last digit – 2<\/u><\/p>\n

reversed = (reversed * 10) + 2 = 123 * 10 + 2 = 1232<\/p>\n

num = num \/\/ 10 = 1<\/p>\n

Extract last digit – 1<\/u><\/p>\n

reversed = (reversed * 10) + 1 = 1232 * 10 + 1 = 12321<\/p>\n

num = num \/\/ 10 = 0<\/p>\n

Step 3\u00a0<\/strong><\/h3>\n

Check if the reversed number is equal to the original number.<\/p>\n

python<\/strong><\/a><\/h4>\n

original = 12321<\/p>\n

reversed = 12321<\/p>\n

Since original == reversed, the number 12321 is a palindrome.<\/p>\n

 <\/p>\n

So, the final result is that the number 12321 is indeed a palindrome according to the palindrome check approach.<\/p>\n

Implementation<\/strong><\/h2>\n

C\/C++ Implementation<\/strong><\/h4>\n
bool checkPalindrome(int original) {int reverseNum = 0;int tempOriginal = original;while (tempOriginal > 0) {int lastDigit = tempOriginal % 10;reverseNum = reverseNum * 10 + lastDigit;tempOriginal = tempOriginal \/ 10;\u00a0 \/\/ Use integer division}if (original == reverseNum) {return true;} else {return false;}}<\/code><\/pre> 
 <\/div> <\/div>\n
\u00a0<\/strong>Java Implementation<\/strong><\/h4>\n
 
public int checkPalindrome(int original) {int reverseNum = 0;int tempOriginal = original;while (tempOriginal > 0) {int lastDigit = tempOriginal % 10;reverseNum = reverseNum * 10 + lastDigit;tempOriginal = tempOriginal \/ 10;}return original == reverseNum ? 1 : 0;}<\/code><\/pre> 
 <\/div> <\/div>\n
\u00a0<\/strong>Python Implementation<\/strong><\/h4>\n
 
\u00a0def checkPalindrome(original):reverseNum = 0tempOriginal = originalwhile tempOriginal > 0:lastDigit = tempOriginal % 10reverseNum = reverseNum * 10 + lastDigittempOriginal = tempOriginal \/\/ 10\u00a0 # Use integer divisionif original == reverseNum:return 1else:return 0\u00a0Special Case<\/code><\/pre> 
 <\/div> <\/div>\n
The above solution will only work if the number is less than 1018, but what would happen if the number is greater than 1018?<\/p>\n
\u00a0<\/strong>Implementation<\/p>\n
C Implementation of Special Case<\/strong><\/h3>\n
 
#include <stdbool.h>#include <string.h>bool checkPalindrome(char original[]) {int n = strlen(original);for (int i = 0; i < n \/ 2; i++) {if (original[i] != original[n - 1 - i]) {return false;}}return true;}<\/code><\/pre> 
 <\/div> <\/div>\n
\u00a0<\/strong>C++ Implementation of Special Case<\/strong><\/h3>\n
C++ implementation of palindrome number detection that handles special cases like negative numbers and single-digit numbers:<\/p>\n
 
#include <string>bool checkPalindrome(std::string original) {int n = original.size();for (int i = 0; i < n \/ 2; i++) {if (original[i] != original[n - 1 - i]) {return false;}}return true;}<\/code><\/pre> 
 <\/div> <\/div>\n
Java Implementation of Special Case<\/strong><\/h3>\n
 
public boolean checkPalindrome(String original) {int n = original.length();for (int i = 0; i < n \/ 2; i++) {if (original.charAt(i) != original.charAt(n - 1 - i)) {return false;}}return true;}<\/code><\/pre> 
 <\/div> <\/div>\n
Python Implementation of Special Case<\/strong><\/h3>\n
 
def checkPalindrome(original):n = len(original)for i in range(0, n\/\/2):if original[i] != original[n - i - 1]:return Falsereturn True<\/code><\/pre> 
 <\/div> <\/div>\n
Frequently Asked Questions<\/strong><\/h2>\n
1.What is a palindrome number?<\/strong><\/h3>\n
A palindrome number is a positive integer that remains the same when its digits are reversed. In other words, it reads the same forwards and backwards. For example, numbers like 121, 1331, and 4554 are palindrome numbers.<\/p>\n
2.How do you check if a number is a palindrome?<\/strong><\/h3>\n
To check if a number is a palindrome, you reverse its digits and compare the reversed number with the original number. If they are the same, the number is a palindrome.<\/p>\n
3.How do you handle negative numbers when checking for palindrome status?<\/strong><\/h3>\n
Negative numbers are typically not considered palindromes. You can include a check at the beginning of your code to return false if the input number is negative.<\/p>\n
4.Are single-digit numbers considered palindromes?<\/strong><\/h3>\n
Yes, by definition, single-digit numbers are considered palindromes because they read the same forwards and backwards.<\/p>\n
5.How do you handle special characters and spaces in a string palindrome check?<\/strong><\/h3>\n
When dealing with string palindromes, you usually remove spaces and ignore special characters. You can preprocess the string to remove spaces and non-alphanumeric characters before performing the palindrome check.<\/p>\n
Related Reads:<\/strong><\/h2>\n