Std::stack

#include <iostream>
#include <stack>
#include <queue>
#include <string>
#include <algorithm>
bool is_palindrome(const std::string &s){
    std::stack<char> LIFO;
    std::queue<char> FIFO;
    for(auto &c: s){
        if(std::isalpha(c)){

            LIFO.push(std::toupper(c));
            FIFO.push(std::toupper(c));
        }
    }
    bool ans;
    while( (LIFO.size() && FIFO.size()) != 0){
        ans = (LIFO.top() == FIFO.front());
        if(!ans){
            return ans;
        }
        LIFO.pop(),FIFO.pop();
    }
    return true ;
}



int main() {
    try{
        std::string s ;
        std::cout << "Enter a string" << std::endl;
        std::cin >> s;
        std::cout << std::boolalpha << is_palindrome( s) << std::endl;
    }catch(std::exception &e){
     std::cout << e.what() << std::endl;
    }

    return 0;
}

Similar codes

0 vote294 views1 answer
How to pronounce beaucoup
C++
0 vote307 views1 answer
Why the << operator is friend
C++
1 vote319 views1 answer
Include guard c++
C++
1 vote316 views1 answer
How to run code in devcpp
C++
0 vote331 views2 answers
Check prime cpp gfg
C++
0 vote362 views1 answer
How to traverse through vector pair
C++
1 vote330 views1 answer
C++ vs g++
C++
0 vote309 views1 answer
2000pp pp play osu std
C++
174 votes402 views15 answers
Int to string c++
C++
10 votes299 views2 answers
Last index of string c++
C++