Given a floating point number N, the task is to check whether it is palindrome or not.
Input: N = 123.321
Input: N = 122.1
- First convert the given floating point number into a character array.
- Initialize the low to first index and high to last index.
- While low < high:
- If character at low is not equal to the character at high then exit and print “No”.
- If character at low is equal to the character at high then continue after incrementing low and decrementing high..
- If the above loop completes successfully then print “Yes”.
Below is the implementation of the above approach:
- Check whether given floating point number is even or odd
- Check if a given string is a valid number (Integer or Floating Point) in Java
- Check if a given string is a valid number (Integer or Floating Point) | SET 1(Basic approach)
- Check if a given string is a valid number (Integer or Floating Point) in Java | SET 2 (Regular Expression approach)
- Check if a number is Palindrome
- Check if a number is Palindrome in PL/SQL
- Check if number is palindrome or not in Octal
- Program to check the number is Palindrome or not
- 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
- To check a number is palindrome or not without using any extra space
- Check if a number with even number of digits is palindrome or not
- Check if actual binary representation of a number is palindrome
- Check if all elements of the array are 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.