Day 18: Queues and Stacks

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

class Solution
{
    //Write your code here
    stack<char> s1;
    queue<char> s2;

public:
    void pushCharacter(char c) { s1.push(c); }
    void enqueueCharacter(char c) { s2.push(c); }

    char popCharacter()
    {
        char re = '\0';

        re = s1.top();
        s1.pop();

        return re;
    }
    char dequeueCharacter()
    {
        char ree = '\0';

        ree = s2.front();
        s2.pop();
        return ree;
    }
};

int main()
{
    // read the string s.
    string s;
    getline(cin, s);

    // create the Solution class object p.
    Solution obj;

    // push/enqueue all the characters of string s to stack.
    for (int i = 0; i < s.length(); i++)
    {
        obj.pushCharacter(s[i]);
        obj.enqueueCharacter(s[i]);
    }

    bool isPalindrome = true;

    // pop the top character from stack.
    // dequeue the first character from queue.
    // compare both the characters.
    for (int i = 0; i < s.length() / 2; i++)
    {
        if (obj.popCharacter() != obj.dequeueCharacter())
        {
            isPalindrome = false;

            break;
        }
    }

    // finally print whether string s is palindrome or not.
    if (isPalindrome)
    {
        cout << "The word, " << s << ", is a palindrome.";
    }
    else
    {
        cout << "The word, " << s << ", is not a palindrome.";
    }

    return 0;
}