Week 5 — Dynamic Programming II
Topics: 2D DP · DP on Strings · DP on Trees · Interval DP
🚧 Content coming soon. This week's material is being prepared. Check back shortly.
What you'll learn this week
- 2D DP: state as a grid, transitions as grid moves
- DP on strings: edit distance, LCS, and palindrome problems
- DP on trees: rethinking subtree aggregation as DP
- Interval DP: merging sub-problems over ranges
Problems to solve
| Problem | Difficulty | Pattern |
|---|---|---|
| Unique Paths | Medium | 2D DP |
| Longest Common Subsequence | Medium | DP on Strings |
| Edit Distance | Hard | DP on Strings |
| Burst Balloons | Hard | Interval DP |
| Regular Expression Matching | Hard | 2D DP |
Full notes, code walkthroughs, and video sessions will be added here.