Videos / DSA

Episode 15 of 22 · DSA, end to end

Stacks, queues and deques: order as a data structure

Chapters

1. A pile of plates0:00
2. A line at the window0:13
3. The locked middle0:30
4. Four operations0:45
5. Secretly a stack1:00
6. Secretly a queue1:17
7. A slip marking the place1:34
8. Doubling, amortised1:51
9. The marching indices2:09
10. Bend it into a ring2:26
11. Full looks like empty2:43
12. The other build3:01
13. Closing the brackets3:18
14. The whole check3:36
15. Two ways to fail3:50
16. Evaluating in postfix4:08
17. Precedence becomes order4:26
18. The stack you already use4:46
19. Looking right for taller5:04
20. The pending pile5:19
21. The walk, in full5:36
22. Counting the work5:52
23. The histogram, reframed6:09
24. Pop, and measure6:25
25. Doors at both ends6:43
26. Blocks, not one block6:58
27. A window that slides7:16
28. Decreasing, at both ends7:33
29. Six windows, six answers7:49
30. The same accounting, again8:05
31. Undo, and redo8:23
32. The trace, and the machine8:40
33. Bounded, on purpose9:00
34. Rings where you cannot allocate9:19
35. The thief at the far end9:39
36. Recognising it in the wild9:57
37. The whole thing10:11

Stacks, queues and deques: order as a data structure. Picture a stack of plates by the sink. You add to the top, you take from the top, and the plate you washed last is the one you dry first. That is a stack. Last in, first out, and n

Mark as watchedSaved in this browser only.