How do I use deque in Python?

How do I use deque in Python?

You can use the collections.deque class to create a double-ended queue. It allows you to append and pop items from both ends efficiently.

Can you show me a simple example?

Sure! Here's a basic example:

from collections import deque

# Create a deque
my_deque = deque()

# Append items
my_deque.append(1)
my_deque.append(2)

# Pop an item from the right
print(my_deque.pop())  # Output: 2

# Append to the left
my_deque.appendleft(0)

# Pop an item from the left
print(my_deque.popleft())  # Output: 0

What are the advantages of using deque over a list?

The main advantages of using deque are its O(1) time complexity for appending and popping from both ends, compared to O(n) for lists when removing from the front.

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.