Reductions
56:52
Recurrences, Karatsuba, Dynamic Programming
41:35
Backtracking: Longest Increasing/Decreasing Sub-sequence
52:04
Dynamic Programming: Intro to Memoization
48:46
P, NP, NP-Hard, NP-Complete, Reduction Example
48:44
Problem Solving with Dijkstra’s
44:35
Context Free Grammars & Push Down Automata
46:31
Why Odd Perfect Numbers Cannot Exist (Pt. II)
45:16