Algorithms Lecture 6 - Dynamic Programming
00:00 Part 1 Intro
00:41 Dynamic Programming
25:39 Minimum Edit Distance
1:11:16 Part 1 Review
1:12:45 Part 2 Intro
1:13:06 Subsequence
1:15:38 Longest Common Subsequence
1:53:30 Longest Increasing Subsequence
2:19:54 Divide-and-Conquer vs Dynamic Programming
2:24:49 Part 2 Review
2:26:00 Part 3 Intro
2:26:12 Knapsack Problem
2:39:35 Unbounded Knapsack
3:10:05 0-1 Knapsack
3:40:36 Review
Instructor: John Roy Daradal
