Lecture 4: Dynamic Programming

• Download notes
• Download additional notes - knapsack probelm
• Videos - original speed
• Videos - 1.4x speed

Videos - Original Speed

Section 1: Longest Increasing Subsequence

Section 2: Elements of Dynamic Programming

Section 3: Edit Distance

Section 4: Memo-ization

Section 5: All-Pairs Shortest Paths

Section 6: Recap and Variants

Videos - 1.4x Speed

Section 1: Longest Increasing Subsequence (1.4x)

Section 2: Elements of Dynamic Programming (1.4x)

Section 3: Edit Distance (1.4x)

Section 4: Memo-ization (1.4x)

Section 5: All-Pairs Shortest Paths (1.4x)

Section 6: Recap and Variants (1.4x)