DSA sheet · Topic
2-D Dynamic Programming interview problems
Tables indexed by two things at once: grid paths, two strings compared character by character, and knapsack-style choices.
- 8 problems
- Java + Python
- Free, no sign-up
15 2-D Dynamic Programming Tables indexed by two things at once: grid paths, two strings compared character by character, and knapsack-style choices. 0 / 8
- 127 Unique Paths Medium Has notes Practice Unique Paths on LeetCode (opens in a new tab)
- 128 Minimum Path Sum Medium Has notes Practice Minimum Path Sum on LeetCode (opens in a new tab)
- 129 Longest Common Subsequence Medium Has notes Practice Longest Common Subsequence on LeetCode (opens in a new tab)
- 130 Edit Distance Medium Has notes Practice Edit Distance on LeetCode (opens in a new tab)
- 131 Coin Change II Medium Has notes Practice Coin Change II on LeetCode (opens in a new tab)
- 132 Target Sum Medium Has notes Practice Target Sum on LeetCode (opens in a new tab)
- 133 Best Time to Buy and Sell Stock with Cooldown Medium Has notes Practice Best Time to Buy and Sell Stock with Cooldown on LeetCode (opens in a new tab)
- 134 Distinct Subsequences Hard Has notes Practice Distinct Subsequences on LeetCode (opens in a new tab)
No problems match these filters.