Set 19 - Classic DP Problems
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 322. Coin Change | Medium | Unbounded knapsack | Video |
| LC 518. Coin Change II | Medium | Count combinations | Video |
| LC 300. Longest Increasing Subsequence | Medium | LIS | 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 322: unbounded knapsack; dp min coins; forward loop.
- LC 518: count combos; dp counts; coins outer loop.
- LC 300: LIS via DP O(n^2) or patience tails.
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...