Back to Patterns
13
1-D Dynamic Programming
1-D Dynamic Programming involves solving optimization problems by breaking them down into simpler subproblems and storing the results of these subproblems in a 1-dimensional array (or just using a few variables to save space) to avoid redundant computations.
Problems (13)
- Climbing StairsDifficulty: Easy
- Coin ChangeDifficulty: Medium
- Decode WaysDifficulty: Medium
- House Robber IIDifficulty: Medium
- House RobberDifficulty: Medium
- Longest Increasing SubsequenceDifficulty: Medium
- Longest Palindromic SubstringDifficulty: Medium
- Maximum Product SubarrayDifficulty: Medium
- Min Cost Climbing StairsDifficulty: Easy
- Numbers At Most N Given Digit SetDifficulty: Hard
- Palindromic SubstringsDifficulty: Medium
- Partition Equal Subset SumDifficulty: Medium
- Word BreakDifficulty: Medium