1-D Dynamic Programming problems

Building up an answer from smaller subproblems along one dimension.

1. Climbing Stairs (Easy)
2. Min Cost Climbing Stairs (Easy)
3. House Robber (Medium)
4. House Robber II (Medium)
5. Longest Palindromic Substring (Medium)
6. Palindromic Substrings (Medium)
7. Decode Ways (Medium)
8. Coin Change (Medium)
9. Maximum Product Subarray (Medium)
10. Word Break (Medium)
11. Longest Increasing Subsequence (Medium)