Set 16 - 1D Dynamic Programming
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 5. Longest Palindromic Substring | Medium | Expand center | Video |
| LC 647. Palindromic Substrings | Medium | Expand center | Video |
| LC 91. Decode Ways | Medium | Count paths | 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 5: expand around center (2n-1 centers).
- LC 647: expand centers; count all palindromes.
- LC 91: dp with 1- and 2-digit validity; handle zeros.
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...