Deque
A deque adds and removes at either end. Both ends stay O(1) with a linked block or a circular buffer.
Costs
| Category | Data Structure |
| Difficulty | Medium |
| Add or remove at the front | O(1) |
| Add or remove at the back | O(1) |
| Random access | O(n) |
Questions
What is Deque?
A deque adds and removes at either end. Both ends stay O(1) with a linked block or a circular buffer.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.