How to Implement a Queue Class in Python Using deque

from collections import deque

class Queue:
    def __init__(self):
        self._items = deque()
    
    def enqueue(self, item):
        self._items.append(item)
    
    def dequeue(self):
        if self.is_empty():
            raise IndexError("dequeue from empty queue")
        return self._items.popleft()
    
    def peek(self):
        if self.is_empty():
            raise IndexError("peek from empty queue")
        return self._items[0]
    
    def is_empty(self):
        return len(self._items) == 0
    
    def size(self):
        return len(self._items)
    
    def __repr__(self):
        return f"Queue({list(self._items)})"

if __name__ == "__main__":
    q = Queue()
    for item in ["a", "b", "c"]:
        q.enqueue(item)
    print(f"Queue: {q}")
    print(f"Size: {q.size()}")
    print(f"Dequeue: {q.dequeue()}")
    print(f"Peek: {q.peek()}")
    print(f"Is empty: {q.is_empty()}")
    print(f"Queue after operations: {q}")