622. Design Circular Queue - LeetCode Solution

class MyCircularQueue:

    def __init__(self, k: int):
        self.a = []
        self.k = k
        

    def enQueue(self, value: int) -> bool:
        
        if len(self.a) == self.k:
            return False
        
        self.a.append(value)
        return True

    def deQueue(self) -> bool:
        if len(self.a) == 0:
            
            return False
        self.a.pop(0)
        return True
        

    def Front(self) -> int:
        if len(self.a) == 0:
            return -1
        return self.a[0]
        

    def Rear(self) -> int:
        if len(self.a) == 0:
            return -1
        return self.a[-1]
        
        

    def isEmpty(self) -> bool:
        if len(self.a) == 0:
            return True
        return False
        

    def isFull(self) -> bool:
        if len(self.a) == self.k:
            return True
        return False
    
        


# Your MyCircularQueue object will be instantiated and called as such:
# obj = MyCircularQueue(k)
# param_1 = obj.enQueue(value)
# param_2 = obj.deQueue()
# param_3 = obj.Front()
# param_4 = obj.Rear()
# param_5 = obj.isEmpty()
# param_6 = obj.isFull()