Back to Patterns
14
2-D Dynamic Programming
2-D Dynamic Programming involves solving optimization problems by breaking them down into simpler subproblems and storing the results of these subproblems in a 2-dimensional array. This is common for problems involving grids, matrices, or comparing two strings/arrays.
Problems (13)
- Best Time to Buy and Sell Stock with CooldownDifficulty: Medium
- Burst BalloonsDifficulty: Hard
- Coin Change IIDifficulty: Medium
- Distinct SubsequencesDifficulty: Hard
- Edit DistanceDifficulty: Medium
- Interleaving StringDifficulty: Medium
- Longest Common SubsequenceDifficulty: Medium
- Longest Increasing Path in a MatrixDifficulty: Hard
- Regular Expression MatchingDifficulty: Hard
- Shortest Path Visiting All NodesDifficulty: Hard
- Target SumDifficulty: Medium
- Unique PathsDifficulty: Medium
- Matrix Chain MultiplicationGeeksforGeeks: Hard