👉 A deque in computer science is a collection of elements that are removed from the beginning and added to the end. It's used for reversing a list or array, but it's not typically associated with any specific data structure like a stack or queue. The concept arises from using a list as a stack to keep track of the last element popped off.
