11. Dynamic Programming: All-Pairs Shortest Paths
1:22:10
12. Greedy Algorithms: Minimum Spanning Tree
51:47
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
1:22:58
13. Incremental Improvement: Max Flow, Min Cut
1:25:25
16. Complexity: P, NP, NP-completeness, Reductions
1:21:51
8. Randomization: Universal & Perfect Hashing
1:22:27
15. Linear Programming: LP, reductions, Simplex
50:48
Lecture 13: Breadth-First Search (BFS)
1:21:08