🧩
Start studying →1-D Dynamic Programming
Optimal substructure with single-dimension state
1 Easy7 Medium0 Hard
All Problems
| # | Problem | Difficulty |
|---|---|---|
| 70 | Climbing Stairs | Easy |
| 198 | House Robber | Medium |
| 213 | House Robber II | Medium |
| 5 | Longest Palindromic Substring | Medium |
| 647 | Palindromic Substrings | Medium |
| 322 | Coin Change | Medium |
| 139 | Word Break | Medium |
| 300 | Longest Increasing Subsequence | Medium |