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...

Target Sum | Backtracking Problem

Introduction: In this tutorial we are going to solve a problem "Target Sum" which is from leetcode. and believe me it's really a good problem to understand Backtracking(Recursion). and if you try to understand the problem as well as code you will get a clear picture of Backtracking. Problem Statement: Link To Problem You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and - . For each integer, you should choose one from + and - as its new symbol. Find out how many ways to assign symbols to make sum of integers equal to target S. Input: nums is [1, 1, 1, 1, 1], S is 3. Output: 5 Explanation: -1+1+1+1+1 = 3 +1-1+1+1+1 = 3 +1+1-1+1+1 = 3 +1+1+1-1+1 = 3 +1+1+1+1-1 = 3 There are 5 ways to assign symbols to make the sum of nums be target 3. Solution: As given in question, we have two operation + and -. so we will make recursive call for + and - . and if we have sum as target and we have reached upto the last ind...

Group Anagrams solution with explanation:Leetcode solution

what is Anagrams? suppose we have two strings and the characters present in both of the strings are same. then both will be called anagram of each other. eg:" rat" and "art" both are anagram of each other. the characters present in both string are same. eg: "raat" and "art" these are not anagrams of each other. and the reason is that the frequency of "a" in "raat" is 2. while the frequency of "a" in "art" is 1. so these are not anagrams of each other. in short two strings will be anagram of each other if they have same characters and the count(frequency) of each and every character must be same in both strings. Solution: There are different ways to solve this question, so here we are going to use Hashmap to solve this question. cause whenever there is need to search we should go with the data structure which use balanced binary tress or hashing. and we know that Hashmap  uses balanced binary trees. so using...