What is a deque and when would you use it instead of a queue or stack?

Answer

A deque (double-ended queue) lets you add and remove elements from both the front and the back. It’s useful when you need both stack- and queue-like operations, or for algorithms like sliding window/monotonic queues.