Design Circular Deque

class MyCircularDeque:

    def __init__(self, k: int):
        self.size = 0
        self.capacity = k
        self.circular_dequeue = [0]*k
        self.front = 0
        self.rear = 0

    def insertFront(self, value: int) -> bool:
        if self.isFull():
            return False
        self.front = (self.front - 1)% self.capacity
        self.size += 1
        self.circular_dequeue[self.front] = value
        return True

    def insertLast(self, value: int) -> bool:
        if self.isFull():
            return False
        
        self.size += 1
        self.circular_dequeue[self.rear] = value
        self.rear = (self.rear + 1)% self.capacity
        return True
    def deleteFront(self) -> bool:
        if self.isEmpty():
            return False
        self.size -= 1
        self.front = (self.front + 1) % self.capacity
        return True

    def deleteLast(self) -> bool:
        if self.isEmpty():
            return False
        self.size -= 1
        self.rear = (self.rear - 1) % self.capacity
        return True
        
    def getFront(self) -> int:
        return self.circular_dequeue[self.front] if not self.isEmpty() else -1

    def getRear(self) -> int:
        return self.circular_dequeue[self.rear-1] if not self.isEmpty() else -1

    def isEmpty(self) -> bool:
        return self.size == 0

    def isFull(self) -> bool:
        return self.size==self.capacity


# Your MyCircularDeque object will be instantiated and called as such:
# obj = MyCircularDeque(k)
# param_1 = obj.insertFront(value)
# param_2 = obj.insertLast(value)
# param_3 = obj.deleteFront()
# param_4 = obj.deleteLast()
# param_5 = obj.getFront()
# param_6 = obj.getRear()
# param_7 = obj.isEmpty()
# param_8 = obj.isFull()