#deque implementation ADT (pronounced "deck") deck

class Deque:

def __init__(self):

self.items = []

def is_empty(self):

return self.items == []

def add_front(self, item):

self.items.append(item)

def add_rear(self,item):

self.items.insert(0,item)

def remove_front(self):

return self.items.pop()

def remove_rear(self):

return self.items.pop(0)

def size(self):

return len(self.items)

#sample use of deque (deck)

def pal_checker(a_string):

char_deque = Deque()

for ch in a_string:

char_deque.add_rear(ch)

still_equal = True

while char_deque.size() > 1 and still_equal:

first = char_deque.remove_front()

last = char_deque.remove_rear()

if first != last:

still_equal = False

return still_equal

print(pal_checker("giberishsssshs"))

print(pal_checker("radar")