Given a string str, the task is to find whether the string is a palindrome or not in Java without using library methods.
Input: str = “abba”
Input: str = “geeks”
Approach: Take two pointers i pointing to the start of the string and j pointing to the end of the string. Keep incrementing i and decrementing j while i < j and at every step check whether the characters at these pointers are same or not. If not then the string is not a palindrome else it is.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important Java and Collections concepts with the Fundamentals of Java and Java Collections Course at a student-friendly price and become industry ready.
- Check whether the given string is Palindrome using Stack
- Check whether the given floating point number is a palindrome
- Sentence Palindrome (Palindrome after removing spaces, dots, .. etc)
- Count all palindrome which is square of a palindrome
- C Program to Check if a Given String is Palindrome
- Python program to check if a string is palindrome or not
- Python program to check if given string is vowel Palindrome
- TCP Client-Server Program to Check if a Given String is Palindrome
- Java program to check palindrome (using library methods)
- C++ program to check whether a String is a Pangram or not
- Check whether second string can be formed from characters of first string
- Bash program to check if the Number is a Palindrome
- Recursive program to check if number is palindrome or not
- Program to check if an array is palindrome or not using Recursion
- Program to check the number is Palindrome or not
- Program to check if an Array is Palindrome or not
- Program to check if an Array is Palindrome or not using STL in C++
- Check if a given string is a rotation of a palindrome
- Recursive function to check if a string is palindrome
- Check if characters of a given string can be rearranged to form a palindrome
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.
Improved By : nishantv