⌂
Home
▦
Patterns
📂
2-D Dynamic Programming
2-D Dynamic Programming
Master these 11 problems to understand the 2-D Dynamic Programming pattern.
Classics
1143. Longest Common Subsequence
Medium
1312. Minimum Insertion Steps to Make a String Palindrome
Hard
72. Edit Distance
Medium
Knapsack
518. Coin Change II
Medium
494. Target Sum
Medium
String DP
97. Interleaving String
Medium
115. Distinct Subsequences
Hard
Grid DP
329. Longest Increasing Path in a Matrix
Hard
62. Unique Paths
Medium
64. Minimum Path Sum
Medium
Interval DP
312. Burst Balloons
Hard