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
0 articles · page 1 of 1Hand-written tutorials, ordered as a recommended learning path.
Tutorials for Queues are on the way.
In the meantime, explore other topics.