Std::queue

#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 vote290 views1 answer
What does map.count() return in c++
C++
0 vote285 views1 answer
Push_back a pair c++
C++
3 votes295 views2 answers
Define and show the implementation of the functions of an arrayList.
C++
1 vote284 views1 answer
C++ vs g++
C++
0 vote276 views1 answer
Pow without math.h
C++
148 votes490 views10 answers
Grepper
C++
0 vote308 views1 answer
Wgat is duble in c++
C++
4 votes279 views2 answers
Gcd recursion c++
C++
0 vote290 views1 answer
C++ declare binary number
C++
0 vote284 views2 answers
C++ program to find prime number using function
C++