LearnThatStack Ace your next interview
Linked Lists, Stacks & Queues · question
Question 9 of 78

What is a deque, and what can it do that a stack or queue cannot?

beginner
← All Linked Lists, Stacks & Queues questions
Re-explain

A deque, short for double-ended queue, lets you add and remove at both ends. Push and pop work on the front and on the back. It is a queue and a stack fused into one structure.

That is exactly what a plain stack or queue cannot do. A stack only touches one end. A queue adds at one end and removes at the other. Neither gives you free access to both ends at once.

This both-end access shows up in real work. Sliding-window scans, work-stealing schedulers, and browser history all rely on it. When a single end is not enough, a deque is the natural next step.

Rewriting in plainer words…

This answer doesn't lend itself to a diagram - it reads best . No credits were charged.

Why there's no diagram: “”

The interactive diagram is below the answer - jump to diagram ↓ · Below it, the related concept . Jump to it ↓

The diagram below the answer is the concept . Jump to it ↓

Tailored explanation · switch back to · ·
What should the new diagram focus on?
Guided practice for Linked Lists, Stacks & Queues One question at a time. Answer out loud, get graded, see what you missed.
How well did you know this?
AI:

Saved in this browser - sign in to keep your review list.

How should your speech become text?

Listening… your words appear above as you speak - tap Stop when you're done.

Recording · cr - tap Stop & transcribe when you're done.

Transcribing with AI…

Voice:

Keep going - a few more words and AI can grade it.

Interview lens How interviewers actually use this question

Likely follow-ups

What you can say

  1. A deque, short for double-ended queue, lets you push and pop at both the front and the back.
  2. So it's really a stack and a queue fused into one structure.
  3. A stack only works at one end, and a queue adds at one end and removes at the other, so neither gives you both ends at once.
  4. You see it in sliding-window scans, work-stealing schedulers and browser history, where the code needs to work both ends.
  5. I reach for one when a single end isn't enough, but if the code only needs LIFO or FIFO, a plain stack or queue makes the intent clearer.

Weak answers to avoid

  • Mixes up deque with the dequeue operation Dequeue is the act of removing from a queue. A deque is a whole structure. Say 'double-ended queue' once so the interviewer knows you mean the structure.
  • Lists operations with no reason to care Push and pop at both ends is the minimum. Add one case where a single end falls short, such as a sliding-window scan, to show you know when to use it.
  • Implies it's fast anywhere, not just at the ends Only the two ends are cheap. Inserting or removing in the middle is still O(n) in common implementations, so be precise about 'both ends'.
Interview lens

Likely follow-ups, what you can say, and the weak answers to avoid.

Sign in free to open it Free account - the lens opens as soon as you're back.

Want a quick review of the fundamentals? See the Linked Lists, Stacks & Queues cheatsheet.

← Back to all Linked Lists, Stacks & Queues questions
Pro · $10/mo

67 of 78 Linked Lists, Stacks & Queues answers are in Pro.

Full answers, code samples, and AI explanations that go simpler or deeper. Cancel anytime.

  • Full answers + code
  • AI explanations, simpler or deeper
  • 1,000 AI credits / month
  • Cancel anytime