Stacks & Queues
Stacks follow Last-In-First-Out (LIFO) principle, while Queues follow First-In-First-Out (FIFO). These abstract data types are crucial for managing data in specific orders and have numerous real-world applications.
Key points
- Stack: LIFO - Last element added is first removed
- Queue: FIFO - First element added is first removed
- Common operations: Push, Pop, Peek in O(1)
- Used in recursion, parsing, BFS/DFS algorithms
- Variants: Priority Queue, Deque, Circular Queue
Problems
Valid Parentheses
Coming soonCheck if string has valid bracket combinations
StackString
Min Stack
Coming soonDesign stack with constant time min operation
StackDesign
Daily Temperatures
Coming soonFind next warmer temperature for each day
Monotonic Stack
Implement Queue using Stacks
Coming soonBuild FIFO queue using two stacks
StackQueueDesign
Largest Rectangle in Histogram
Coming soonFind largest rectangle area in histogram
Monotonic StackArray