Deque

Easy

Deque

Double-Ended Queue. A data structure that allows insertion and deletion at both ends.

📊 Complexity

Type	Value
Best	O(1)
Average	O(1)
Worst	O(1)
Space	O(n)

🏷️ Tags

Data StructureDequeDouble-Ended Queue

📖 Introduction

Deque (Double-Ended Queue) is a data structure that allows insertion and deletion at both ends. It combines the characteristics of both stack and queue for flexible use.

1/14

↔️Create Deque

Create an empty deque. Insert/delete from both ends.

Basics

Deque

Definition

Deque (Double-Ended Queue) is a data structure that allows insertion and deletion at both ends. It combines the characteristics of both stack and queue for flexible use.

Key Characteristics

✓O(1) insertion/deletion at both ends
✓Can be used as a stack (using one end only)
✓Can be used as a queue (different operations at each end)
✓Frequently used in sliding window algorithms

Time Complexity

Best

O(1)

Average

O(1)

Worst

O(1)

Space Complexity

O(n)

Deque | AlgoNote