Dynamic programming

Course Curriculum

Chapter 1: Introduction

Lecture 1: What is dynamic programming

Lecture 2: Reminder on recursion

Chapter 2: Top-down approach (memoization) and bottom-up approach (tabulation)

Lecture 1: Top-down approach (memoization)

Lecture 2: Bottom-up approach (tabulation)

Lecture 3: Top-down vs Bottom-up

Chapter 3: How to solve almost any dynamic programming problem

Lecture 1: Directed acyclic graphs in dynamic programming

Chapter 4: Full example: minimum cost path

Lecture 1: Minimum cost path problem

Lecture 2: How to solve almost any dynamic programming problem

Lecture 3: Minimum cost path problem (code)

Chapter 5: Practice: Paths in matrix problem

Lecture 1: Paths in matrix (solution)

Lecture 2: Paths in matrix (code)

Chapter 6: Practice: House robber problem

Lecture 1: House robber (solution)

Lecture 2: House robber (code)

Chapter 7: Practice: Longest common subsequence problem

Lecture 1: Longest common subsequence (solution)

Lecture 2: Longest common subsequence (code)

Chapter 8: Practice: Gold mine problem

Lecture 1: Gold mine (solution)

Lecture 2: Gold mine (code)

Chapter 9: Practice: Edit distance problem

Lecture 1: Edit distance (solution)

Lecture 2: Edit distance (code)

Chapter 10: Practice: Ways to climb problem

Lecture 1: Ways to climb (solution)

Lecture 2: Ways to climb (code)

Chapter 11: Practice: Shortest common supersequence problem

Lecture 1: Shortest common supersequence (solution)

Lecture 2: Shortest common supersequence (code)

Chapter 12: Practice: Coin change problem

Lecture 1: Coin change (solution)

Lecture 2: Coin change (code)

Chapter 13: Practice: 0-1 knapsack problem

Lecture 1: 0-1 knapsack (solution)

Lecture 2: 0-1 knapsack (code)

Chapter 14: Practice: Subset sum problem

Lecture 1: Subset sum (solution)

Lecture 2: Subset sum (code)

Chapter 15: Practice: Longest increasing subsequence problem

Lecture 1: Longest increasing subsequence (solution)

Lecture 2: Longest increasing subsequence (code)

Chapter 16: Practice: Ways to decode problem

Lecture 1: Ways to decode (solution)

Lecture 2: Ways to decode (code)

Chapter 17: Practice: Partition problem

Lecture 1: Partition (solution)

Lecture 2: Partition (code)

Chapter 18: Practice: Rod cutting problem

Lecture 1: Rod cutting (solution)

Lecture 2: Rod cutting (code)

Chapter 19: Practice: Square matrix of ones problem

Lecture 1: Square matrix of ones (solution)

Lecture 2: Square matrix of ones (code)

Chapter 20: Practice: Minimum cost for tickets problem

Lecture 1: Minimum cost for tickets (solution)

Lecture 2: Minimum cost for tickets (code)

Chapter 21: Practice: Interleaving string problem

Lecture 1: Interleaving string (solution)

Lecture 2: Interleaving string (code)

Chapter 22: Practice: Sorted vowel strings problem

Lecture 1: Count sorted vowel strings (solution)

Lecture 2: Count sorted vowel strings (code)

Chapter 23: Practice: Word break problem

Lecture 1: Word break (solution)

Lecture 2: Word break (code)

Chapter 24: Practice: Matrix chain problem

Lecture 1: Matrix chain problem (solution)

Lecture 2: Matrix chain problem (code)