LeedCode
Problems
1-D Dynamic Programming
31 remaining tasks
0070 - Climbing Stairs
Easy
0746 - Min Cost Climbing Stairs
Easy
0198 - House Robber
Easy
0213 - House Robber II
Easy
0005 - Longest Palindromic Substring
Easy
0647 - Palindromic Substrings
Easy
0091 - Decode Ways
Easy
0322 - Coin Change
Easy
0152 - Maximum Product Subarray
Easy
0139 - Word Break
Easy
0300 - Longest Increasing Subsequence
Easy
0416 - Partition Equal Subset Sum
Easy
0120 - Triangle
Easy
0740 - Delete And Earn
Easy
0256 - Paint House
Easy
0377 - Combination Sum IV
Easy
0279 - Perfect Squares
Easy
1856 - Maximum Subarray Min Product
Easy
0983 - Minimum Cost For Tickets
Easy
0343 - Integer Break
Easy
0673 - Number of Longest Increasing Subsequence
Easy
0691 - Stickers to Spell Word
Easy
1137 - N-th Tribonacci Number
Easy
1035 - Uncrossed Lines
Easy
2140 - Solving titles With Brainpower
Easy
2466 - Count Ways to Build Good Strings
Easy
0837 - New 21 Game
Easy
1626 - Best Team with no Conflicts
Easy
1406 - Stone Game III
Easy
0472 - Concatenated Words
Easy
1799 - Maximize Score after N Operations
Easy
Mark as complete
Shortcut: Ctrl + .
