Day_18_Queues_and_Stacks.py

import sys

class Solution:
    def __init__(self):
        self.l1 = []
        self.l2 = []
    def pushCharacter(self,char):
        self.char = char
        self.l1.append(char)
    def enqueueCharacter(self,char2):
        self.char2 = char2
        self.l2.append(char2)
    def popCharacter(self):
        return self.l1.pop()
    def dequeueCharacter(self):
        return self.l2.pop(0)

        
        

# read the string s
s=input()
#Create the Solution class object
obj=Solution()   

l=len(s)
# push/enqueue all the characters of string s to stack
for i in range(l):
    obj.pushCharacter(s[i])
    obj.enqueueCharacter(s[i])
    
isPalindrome=True
'''
pop the top character from stack
dequeue the first character from queue
compare both the characters
''' 
for i in range(l // 2):
    if obj.popCharacter()!=obj.dequeueCharacter():
        isPalindrome=False
        break
#finally print whether string s is palindrome or not.
if isPalindrome:
    print("The word, "+s+", is a palindrome.")
else:
    print("The word, "+s+", is not a palindrome.")    