Deque

A deque, short for double-ended queue, is a data structure that allows you to add or remove items from both ends—front and back—efficiently. Think of it like a line where you can insert or remove people from either the front or the end, unlike a traditional queue where you only add at the back and remove from the front. This flexibility makes deques useful in situations that require dynamic, order-sensitive operations, such as managing tasks, browsing history, or scheduling. They are commonly implemented in software to optimize performance in algorithms and processes that need quick access to both ends of a collection.