Topics / Queues
🚦
Queues
FIFO data structure — powering BFS, scheduling, sliding-window maxima, and rate limiters.
Why learn Queues?
-
The backbone of breadth-first search.
-
Deques unlock O(1) sliding-window problems.
-
Maps directly to real systems — job queues, message brokers, schedulers.
What you can build with Queues
BFS on trees and graphs Sliding-window maximum / minimum Producer-consumer and rate-limiter systems
Queues tutorials
2 articlesHand-written tutorials, ordered as a recommended learning path.
- 01 Stacks & Queues A practical introduction to stacks and queues — LIFO vs FIFO, using a Python list as a stack, collections.deque as a queue, and the real-world problems each one solves cleanly.
- 02 Stacks/Queues — Practice Eight classic stack and queue interview problems with worked Python solutions — Valid Parentheses, Min Stack, Daily Temperatures, Sliding Window Maximum, and more.