# Check whether the given string is Palindrome using Stack in Python // C++ implementation of the approach#include <bits/stdc++.h>using namespace std;// Function that returns true// if string is a palindromebool isPalindrome(string s){    int length = s.size();    // Creating a Stack    stack<char> st;    // Finding the mid    int i, mid = length / 2;    for (i = 0; i < mid; i++) {        st.push(s[i]);    }    // Checking if the length of the string    // is odd, if odd then neglect the    // middle character    if (length % 2 != 0) {        i++;    }       char ele;    // While not the end of the string    while (s[i] != '\0')    {         ele = st.top();         st.pop();    // If the characters differ then the    // given string is not a palindrome    if (ele != s[i])        return false;        i++;    }return true;}// Driver codeint main(){    string s = "madam";    if (isPalindrome(s)) {        cout << "Yes";    }    else {        cout << "No";    }    return 0;}// This Code is Contributed by Harshit Srivastava