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

3 votes243 views2 answers
Pre increment vs post increment c++
C++
0 vote263 views1 answer
Sum of first 100 natural numbers
C++
1 vote311 views1 answer
Factore of 20 in c+
C++
0 vote242 views1 answer
Pascal's triangle in c++ through pointer
C++
2 votes257 views1 answer
C++ print current time
C++
0 vote278 views1 answer
Fabs c c++
C++
0 vote299 views1 answer
Array must be initialized with a brace-enclosed initializer
C++
3 votes238 views1 answer
Stl library c++ header
C++
0 vote286 views1 answer
Cuda atomic swap
C++
0 vote259 views1 answer
Iff
C++