ReviseAlgo Logo

Collections Framework

Deque Interface

Analyze the Deque interface double-ended queue capabilities, stack/queue mappings, and implementations.

Interview: Focuses on LIFO/FIFO method mappings, comparison of ArrayDeque vs LinkedList, and stack replacement methods.

Last Updated: June 13, 2026 • 10 min read

The java.util.Deque interface (Double-Ended Queue) represents a linear collection that supports element insertion and removal at both ends. It serves as both a FIFO queue and a LIFO stack.

Double-Ended

Declares head and tail methods: addFirst/addLast, removeFirst/removeLast, and peekFirst/peekLast.

Stack Replacement

Declares LIFO methods push, pop, and peek to replace the legacy Stack class.

Implementations

Implemented by ArrayDeque (array-backed, preferred) and LinkedList (pointer-backed).

Stack and Queue Method Mappings

Deque maps its double-ended operations to standard Queue and Stack behaviors:

  • Queue FIFO equivalents: add(e) maps to addLast(e), poll() maps to pollFirst(), and peek() maps to peekFirst().
  • Stack LIFO equivalents: push(e) maps to addFirst(e), pop() maps to removeFirst(), and peek() maps to peekFirst().

Common Pitfalls

  • Confusing head and tail method mapping: Mixing up stack and queue methods (e.g. calling addFirst then pop on the same end, instead of opposite ends for queues).
  • Null values: Inserting nulls into Deque implementations (like ArrayDeque), which throws a NullPointerException.

Best Practices

  • Prefer ArrayDeque: Choose ArrayDeque over LinkedList for standard stack and double-ended queue operations.
  • Declare targets explicitly: Code to the interface type: Deque<T> deque = new ArrayDeque<>().

Interview-Relevant Information

Q1: Why is Deque preferred over Stack for LIFO operations?
Answer: Deque provides stack operations (push, pop, peek) using implementations like ArrayDeque, which do not inherit from synchronized Vector classes. This prevents synchronization overhead and blocks invalid index-based modifications.

Q2: Which implementation should you prefer for Deque: ArrayDeque or LinkedList?
Answer: ArrayDeque is preferred for most scenarios. It uses less memory (no Node wrappers) and has better CPU cache characteristics. LinkedList is only preferred if elements are frequently inserted or removed in the middle during iteration.

Quick Checklist

Can you define double-ended queues, map queue and stack methods to Deque methods, and explain why ArrayDeque is generally faster than LinkedList? If yes, you understand Deque interface.

Use Cases

Building task-stealing algorithms in thread schedulers.

Implementing sliding window algorithms using double-ended boundaries.

Common Mistakes

Inserting null elements into an ArrayDeque.

Mixing stack and queue method terminologies, leading to bugs.