1-D Dynamic Programming Problems - Blind 75 LeetCode

Problem Name	Difficulty
70. Climbing Stairs	Easy
198. House Robber	Medium
213. House Robber II	Medium
5. Longest Palindromic Substring	Medium
647. Palindromic Substrings	Medium
91. Decode Ways	Medium
322. Coin Change	Medium
152. Maximum Product Subarray	Medium
139. Word Break	Medium
300. Longest Increasing Subsequence	Medium

Contribute

If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.

Resources

• LeetCode: The official LeetCode website.

• LeetCode Discuss: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.

Happy coding!