Stacks & Queues
Two humble rules, LIFO and FIFO, doing surprisingly heavy lifting.
Stacks & Queues progress0 / 9
- Stack BasicsLast one in is the first one out.4m
- Valid ParenthesesA closing bracket must answer the newest opening one.5m
- Queue BasicsFirst one in is the first one out.4m
- Queue From Two StacksReverse a reversal and LIFO turns into FIFO.5m
- Monotonic StackKeep the stack ordered and every item waits only once.6m
- Min StackCarry the answer up with the data instead of recomputing it.5m
- Sliding Window MaximumA queue that drops anyone it has already outgrown.6m
- Circular QueueA fixed array that never shifts, because the ends wrap around.5m
- Largest RectangleEvery bar waits on the stack until both its walls are known.7m
Quiz yourself: 3 questions from this module
1 / 3