Problem Solving with Dijkstra’s
51:29
Shortest Paths Problems in Graphs: Dijiksras, DAGs
56:52
Recurrences, Karatsuba, Dynamic Programming
41:23
Reductions
41:35
Backtracking: Longest Increasing/Decreasing Sub-sequence
26:23
Dynamic Programming: Largest Square of 1's
49:47
Problem Solving: NP-Hard/NPC/Decidable/Undecidable
45:16
NP-Hardness Proofs
27:22