Set 17 - 2D Dynamic Programming
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 62. Unique Paths | Medium | Grid DP | Video |
| LC 63. Unique Paths II | Medium | Grid DP + obstacles | Video |
| LC 64. Minimum Path Sum | Medium | Grid DP | Video |
Deliverables
- Write a 1-line invariant for each problem.
- Note 1 edge case or pitfall per problem.
- Record time-to-first-correct solution.
Notes
- LC 62: grid DP from top/left (or combinatorics).
- LC 63: obstacles block paths; dp=0 if obstacle.
- LC 64: dp[i][j]=grid+min(top,left).
Review
- Time spent + where you got stuck?
- Biggest mistake or missed edge case?
- One concrete improvement for next time.
Comments
Share your approach or ask questions
?
|
Markdown supported
Sign in to post
Loading comments...