1-D Dynamic Programming
Break a problem into overlapping subproblems indexed by one variable.
- 174.70. Climbing Stairs
- 175.746. Min Cost Climbing Stairs
- 176.198. House Robber
- 177.213. House Robber II
- 178.5. Longest Palindromic Substring
- 179.647. Palindromic Substrings
- 180.91. Decode Ways
- 181.322. Coin Change
- 182.152. Maximum Product Subarray
- 183.139. Word Break
- 184.300. Longest Increasing Subsequence
- 185.416. Partition Equal Subset Sum
- 186.1137. N-th Tribonacci Number
- 187.279. Perfect Squares
- 188.377. Combination Sum IV
- 189.343. Integer Break
- 190.1406. Stone Game III