DSA sheet · Topic
1-D Dynamic Programming interview problems
Breaking a problem into overlapping subproblems along one dimension: from plain recursion, to memoization, to a few variables.
- 12 problems
- Java + Python
- Free, no sign-up
14 1-D Dynamic Programming Breaking a problem into overlapping subproblems along one dimension: from plain recursion, to memoization, to a few variables. 0 / 12
- 115 Climbing Stairs Easy Has notes Practice Climbing Stairs on LeetCode (opens in a new tab)
- 116 Min Cost Climbing Stairs Easy Has notes Practice Min Cost Climbing Stairs on LeetCode (opens in a new tab)
- 117 House Robber Medium Has notes Practice House Robber on LeetCode (opens in a new tab)
- 118 House Robber II Medium Has notes Practice House Robber II on LeetCode (opens in a new tab)
- 119 Coin Change Medium Has notes Practice Coin Change on LeetCode (opens in a new tab)
- 120 Maximum Product Subarray Medium Has notes Practice Maximum Product Subarray on LeetCode (opens in a new tab)
- 121 Word Break Medium Has notes Practice Word Break on LeetCode (opens in a new tab)
- 122 Decode Ways Medium Has notes Practice Decode Ways on LeetCode (opens in a new tab)
- 123 Longest Increasing Subsequence Medium Has notes Practice Longest Increasing Subsequence on LeetCode (opens in a new tab)
- 124 Partition Equal Subset Sum Medium Has notes Practice Partition Equal Subset Sum on LeetCode (opens in a new tab)
- 125 Longest Palindromic Substring Medium Has notes Practice Longest Palindromic Substring on LeetCode (opens in a new tab)
- 126 Palindromic Substrings Medium Has notes Practice Palindromic Substrings on LeetCode (opens in a new tab)
No problems match these filters.