How can I implement a queue using a deque in Python?

How can I implement a queue using a deque in Python?

You can use the collections.deque class in Python to implement a queue. It allows for efficient appends and pops from both ends.

Can you show me a simple code example?

Sure! Here's a basic example:

from collections import deque

class Queue:
    def __init__(self):
        self.queue = deque()

    def enqueue(self, item):
        self.queue.append(item)

    def dequeue(self):
        return self.queue.popleft() if self.queue else None

    def is_empty(self):
        return len(self.queue) == 0

    def size(self):
        return len(self.queue)

What if I want to see the front item without removing it?

You can add a method to peek at the front item. Here's how:

    def peek(self):
        return self.queue[0] if self.queue else None