A string is said to be a palindrome if the reverse of the string is the same as the string.
For instance,
a="MOM"
b="NOON"
c="ABCDCBA"
Program Code:
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
char str[100];
int i, length;
int flag = 0;
cout<<"\n Enter String : ";
cin>>str;
length = strlen(str);
for(i=0;i < length ;i++)
{
if(str[i] != str[length-i-1])
{
flag = 1;
break;
}
}
if(flag)
{
cout<<" "<<str<<" is not a palindrome"<<endl;
}
else
{
cout<<" "<<str<< " is a palindrome"<<endl;
}
return 0;
}
Output:
Enter String : MOM
MOM is a palindrome
Enter String : Selena
Selena is not a palindrome
Note: also read about Find the Reverse of a Number
Please follow me to read my latest post on programming and technology if you like my post.
https://www.instagram.com/coderz.py/
https://www.facebook.com/coderz.py
Staying up to the mark is what defines me. Hi all! I’m Rabecca Fatima a keen learner, great enthusiast, ready to take new challenges as stepping stones towards flying colors.
Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…
Given an integer A. Compute and return the square root of A. If A is…
Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…
A heap is a specialized tree-based data structure that satisfies the heap property. It is…
What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…