Given an integer, write a function that returns true if the given number is palindrome, else false. For example, 12321 is palindrome, but 1451 is not palindrome.
Let the given number be num. A simple method for this problem is to first reverse digits of num, then compare the reverse of num with num. If both are same, then return true, else false.
Input : 12221 Output : true Input : 12345 Output : false
Below is the required implementation:
- Check if a number is Palindrome
- Check if number is palindrome or not in Octal
- Program to check the number is Palindrome or not
- To check a number is palindrome or not without using any extra space
- Generate number with given operation and check if it is palindrome
- Recursive program to check if number is palindrome or not
- Bash program to check if the Number is a Palindrome
- Check if a number with even number of digits is palindrome or not
- Check if actual binary representation of a number is palindrome
- Check whether a string is palindrome or not in PL/SQL
- Program to check if an Array is Palindrome or not
- Check if all elements of the array are palindrome or not
- Check if it is possible to create a palindrome string from given N
- Program to check if an Array is Palindrome or not using STL in C++
- Queries to check if substring[L...R] is palindrome or not
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.