Stacks & Queues
Stacks and queues are fundamental data structures that provide specific ordering and access patterns essential for many algorithms.
Learning Map
Prerequisites
What's in scope
- Stack Applications: Expression evaluation, parentheses matching, monotonic stack, and histogram problems
- Queue Applications: BFS implementation, sliding window maximum, task scheduling, and level-order traversal
- Deque & Priority Queue: Double-ended operations, heap implementation, top K problems, and task prioritization
How to use this section
- Start with Stack Applications to understand stack-based algorithms
- Learn Queue Applications for BFS and scheduling problems
- Master Deque & Priority Queue for advanced operations
📄️ Stack Applications
Master stack applications including expression evaluation, parentheses matching, monotonic stacks, and solving histogram problems efficiently.
📄️ Queue Applications
Explore practical queue applications including BFS traversal, task scheduling, and sliding window maximum with deques for efficient problem-solving.
📄️ Deque and Priority Queue
Master double-ended queues and priority queues including heap implementation, top-K problems, and running median for advanced queue applications.