A string is said to be palindrome if the reverse of the string is the same as the string. For example, “abba” is a palindrome because the reverse of “abba” will be equal to “abba” so both of these strings are equal and are said to be a palindrome, but “abbc” is not a palindrome.
In this article, we will see a simple program to check whether the string is palindrome or not.
Algorithm
- Initialize 2 variables, l from the start and h from the end of the given string.
- Now, we will compare the characters at index l and h with each other
- If the characters are not equal, the string is not palindrome.
- If the characters are equal, we will increment l and decrement h.
- Steps 2,3 and 4 will be repeated till ( l < h ) or we find unequal characters.
- If we reach the condition ( l < h ), it means all the corresponding characters are equal and the string is palindrome.
Basically, we traverse the string in forward and backward directions comparing characters at the same distance from start and end. If we find a pair of distinct characters, the string is not palindrome. If we reach the midpoint, the string is palindrome.
Palindrome String Program in C
C
#include <stdio.h>
#include <string.h>
int main()
{
char str[] = { "abbba" };
int l = 0;
int h = strlen(str) - 1;
while (h > l) {
if (str[l++] != str[h--]) {
printf("%s is not a palindrome\n", str);
return 0;
}
}
printf("%s is a palindrome\n", str);
return 0;
}
|
Output
abbba is a palindrome
Complexity Analysis
Time complexity: O(n), where n is the number of characters in the string.
Auxiliary Space: O(1)
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!