L
e
e
t
M
o
t
i
o
n
⌂
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
Locked
🔒 1312. Minimum Insertion Steps to Make a String Palindrome
Locked
🔒 72. Edit Distance
Locked
Knapsack
🔒 518. Coin Change II
Locked
🔒 494. Target Sum
Locked
String DP
🔒 97. Interleaving String
Locked
🔒 115. Distinct Subsequences
Locked
Grid DP
🔒 329. Longest Increasing Path in a Matrix
Locked
🔒 62. Unique Paths
Locked
🔒 64. Minimum Path Sum
Locked
Interval DP
🔒 312. Burst Balloons
Locked