HackMD
Queue Study Guide
Basic Queue Operations
Simple Queue
Implementation and usage of a basic queue structure.
Circular Queue
Implementation of a queue with a fixed size that wraps around.
Advanced Queue Types
Double-ended Queue (Deque)
A queue that allows insertion and deletion at both ends.
Priority Queue (Heap)
A queue where elements have associated priorities.
- 🟥 23. Merge k Sorted Lists
- 🟨 215. Kth Largest Element in an Array [Solution]
- 🟥 295. Find Median from Data Stream
- 🟨 973. K Closest Points to Origin
Queue-based Problems
Top K Problems
Problems involving finding the K most frequent or largest elements.
- 🟨 347. Top K Frequent Elements [Solution]
- 🟨 692. Top K Frequent Words [Solution]
- 🟨 658. Find K Closest Elements [Solution]
Interval Problems
Problems involving overlapping intervals or ranges.
Task Scheduling
Problems involving scheduling or organizing tasks.
- 🟨 621. Task Scheduler [Solution]
Problem Difficulty Legend
- 🟩 Easy
- 🟨 Medium
- 🟧 Medium-Hard
- 🟥 Hard
- ⬛ Very Hard
