49:47

Problem Solving: NP-Hard/NPC/Decidable/Undecidable

41:23

Reductions

56:52

Recurrences, Karatsuba, Dynamic Programming

51:29

Shortest Paths Problems in Graphs: Dijiksras, DAGs

38:21

Binary Search

45:16

NP-Hardness Proofs

52:04

Dynamic Programming: Intro to Memoization

41:35

Backtracking: Longest Increasing/Decreasing Sub-sequence