How do I use collections.deque in Python?

How do I use collections.deque in Python?

You can use collections.deque to create a double-ended queue that allows you to add or remove elements from both ends efficiently.

What are the main advantages of using deque over a list?

The main advantages are that deque provides O(1) time complexity for appends and pops from both ends, while lists have O(n) for these operations.

Can you show me a simple example of how to implement it?

Sure! Here's a simple example:

from collections import deque

# Create a deque
my_deque = deque()

# Add elements
my_deque.append(1)
my_deque.appendleft(2)

# Remove elements
my_deque.pop()  # Removes 1
my_deque.popleft()  # Removes 2

Are there any limitations I should be aware of?

One limitation is that deque does not support random access like lists do, so accessing elements by index is slower.