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 vote177 views1 answer
How to fill vector from inputs c++
C++
0 vote171 views1 answer
Ue4 foreach loop c++
C++
0 vote156 views10 answers
Convert java code to c++ online
C++
0 vote109 views1 answer
C++ starting syntaz
C++
-1 vote159 views4 answers
Time complexity analysis of algorithms calculator
C++
0 vote158 views1 answer
C language all keywords in string
C++
3 votes148 views2 answers
Pre increment vs post increment c++
C++
0 vote105 views1 answer
List that doesn't allow duplicates c++
C++
4 votes187 views1 answer
Deep copy c++
C++
0 vote164 views1 answer
C++ print unsigned long
C++