Categories: C++

Program to check Palindrome string

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

Follow Me

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

Recent Posts

Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java

Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…

2 months ago

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

1 year ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

1 year ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

1 year ago