1-D Dynamic Programming
Master these 13 problems to understand the 1-D Dynamic Programming pattern.
70. Climbing StairsEasy
746. Min Cost Climbing StairsEasy
198. House RobberMedium
213. House Robber IIMedium
5. Longest Palindromic SubstringMedium
647. Palindromic SubstringsMedium
91. Decode WaysMedium
322. Coin ChangeMedium
152. Maximum Product SubstringMedium
139. Word BreakMedium
300. Longest Increasing SubsequenceMedium
416. Partition Equal Subset SumMedium
309. Best Time to Buy and Sell Stock with CooldownMedium