Skip to main content

C++ Basic Programs | Check Palindrome

Introduction:
In this tutorial, we are going to solve a basic problem on string. and this is really an important problem to understand few concepts related to problem solving.basically today we are going to solve a problem in which we will try to find whether a given string is palindrome string or not?

Problem Statement:
We have given a string s. and then we have to check whether it is palindrome string or not?

Input:string s = "sana"
Output: "No"

Input: string s = "abba"
Output: "yes"

Solution:
let's first of all understand, what palindrome means?
Anything is palindrome if we get the same result from left view and right view.
eg: "abba" is palindrome, cause you see it from right or left, it will be same.
eg: "Abba" is not a palindrome, cause from left it starts with "A", while from right, it starts with "a".

we can solve this problem by two methods:
1.Using two pointer(easy one)
2.Using Stack(it will take extra space).

so let's see the first method, which is more efficient. or you can see whenever there is palindrome question you can follow above mentioned two methods.

Full code:

#include<bits/stdc++.h>
using namespace std;

int main(){
string s;
cin>>s;
int n=s.size();
int flag=0;
for(int i=0; i<n;i++){
       if(s[i]!=s[n-1-i]){
           flag=1;
           break;
       }
}
if(flag==0){
cout<<"yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}

so the idea is, in first iteration we will check first and last character of string, if it matches, then in second iteration we will check second character from the beginning and second character from last and so on.
and this is done by s[i]!=s[n-1-i] this piece of code. if there is a mismatch then it means the given string is not palindrome and we will stop iteration here. and set the flag value to 1.flag variable will keep track that we have found a mismatch or not. if we found a mismatch then we will set flag to 1.

Conclusion:
Start checking from both end at the same moment if both matches, then we will proceed further, otherwise we will stop the execution.

i hope you got my points.

Comments

Popular posts from this blog

Disjiont Set Union-Find Data Structure | Code In C++

 Introduction:  In this tutorial we are going to write full program of disjoint set union find advance data structure in c++.  Problem Description: Disjoint Set Union (DSU) is an advance data structure, which basically uses in graph algorithms to find cycles. Codes:  Method1: Brute Force #include<bits/stdc++.h> using namespace std; int find(int f,vector<int>&dsuf){     if(dsuf[f]==-1)         return f;     return find(dsuf[f],dsuf); } void union_op(int from, int to, vector<int>& dsuf){     dsuf[from]=to; } bool isCycle(vector<pair<int,int> >&edge_list, vector<int>&dsuf){     for(int i=0;i<edge_list.size();i++){         int parent1=find(edge_list[i].first,dsuf);         int parent2=find(edge_list[i].second,dsuf);         if(parent1==pare...

Linked List Data Structure | Add Two Number Explanation

Introduction: In this tutorial, we are going to solve a very famous problem on Linked List. It is also an important question for coding interview. so let's see the problem and understand it in detail. Problem Statement: There are two numbers and each digit of number is represented by a node of linked list.and we have to add these two numbers, which is given in the form of linked list. Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 eg: num1 = 2354;       num2 = 875; see the image below: Solution: Now let's solve it. In this problem there may be three possibilities. First: Number of Nodes in the first linked list is greater than second linked list. Second: Number of Nodes in first linked list is less than second list. Third: Number of Nodes in the both linked list is equal. Here number of nodes means number of digits in both number. Another thing we have to keep in mind is that if we add two digits then there may be possibility of gen...

Integrating Frontend to Backend | MERN stack(100% working)

How to Integrate frontend to backend in MERN stack? For integrating the frontend to backend just do two things. Step1: Go and install cors on both side (front end as well as backend)              To install cors simply open the folder into terminal and type npm install cors--save. step 2: just go to your front end section(react app) open package.json file.                 and just add one line into package.json file.           "proxy":"http://localhost:4000" here i am using 4000, so what is 4000 ?. this is the port  on which our backend is listening. so it may be possible that u may have other port number on which your server is listening. so put yours port number on which your backend server is listening. and this proxy thing we have to add in frontend part not in backend part. Now it may be possible that you want to know ...