Design a Deque (Double-Ended Queue)
Implement a double-ended queue (deque) data structure that allows efficient insertion and removal of elements from both the front and rear ends.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid November, 2025
Mid-level
Used Linked List with 2 pointers head and tail
Hello Interview Premium
Your account is free and you can post anonymously if you choose.