L
e
e
t
M
o
t
i
o
n
⌂
Home
▦
Patterns
📂
1-D Dynamic Programming
1-D Dynamic Programming
Master these 13 problems to understand the 1-D Dynamic Programming pattern.
🔒 70. Climbing Stairs
Locked
🔒 746. Min Cost Climbing Stairs
Locked
🔒 198. House Robber
Locked
🔒 213. House Robber II
Locked
🔒 5. Longest Palindromic Substring
Locked
🔒 647. Palindromic Substrings
Locked
🔒 91. Decode Ways
Locked
🔒 322. Coin Change
Locked
🔒 152. Maximum Product Substring
Locked
🔒 139. Word Break
Locked
🔒 300. Longest Increasing Subsequence
Locked
🔒 416. Partition Equal Subset Sum
Locked
🔒 309. Best Time to Buy and Sell Stock with Cooldown
Locked