• + 0 comments

    In Python 3

    import sys

    class Solution:

    def __init__(self):
        self.queue = []
        self.stack = []
    def pushCharacter(self, char):
        self.stack.append(char)
    def enqueueCharacter(self, char):
        self.queue.append(char)
    def popCharacter(self):
        return self.stack.pop(-1)
    def dequeueCharacter(self):
        return self.queue.pop(0)
    

    s=input()

    obj=Solution()

    l=len(s)

    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

    if isPalindrome: print("The word, "+s+", is a palindrome.") else: print("The word, "+s+", is not a palindrome.")