Set 18 - 2D Dynamic Programming
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 72. Edit Distance | Medium | String DP | Video |
| LC 1143. Longest Common Subsequence | Medium | String DP | Video |
| LC 97. Interleaving String | Medium | String 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 72: edit distance dp (insert/delete/replace).
- LC 1143: LCS dp; match +1 else max top/left.
- LC 97: dp over i,j matching s1/s2 with s3.
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...