Dynamic Programming

Optimize solutions with memoization and tabulation

3 chapters 12 lessons 129 min total

DP Foundations

4 lessons · 38 min
FREE
What is Dynamic Programming
Overlapping subproblems and optimal substructure
10 min FREE
Memoization (Top-Down)
Caching recursive results
10 min FREE
Tabulation (Bottom-Up)
Building solutions iteratively
10 min
Identifying DP Problems
Recognizing when to apply DP
8 min

1D DP Problems

4 lessons · 42 min
5 credits
Climbing Stairs
Classic counting problem
8 min
House Robber
Maximum non-adjacent sum
10 min
Coin Change
Minimum coins to make amount
12 min
Longest Increasing Subsequence
Finding LIS efficiently
12 min

2D DP Problems

4 lessons · 49 min
5 credits
Grid Paths
Counting unique paths in a grid
10 min
Edit Distance
Minimum operations to transform strings
12 min
Longest Common Subsequence
Finding LCS of two strings
12 min
Knapsack Problem
0/1 and unbounded variants
15 min