Back to all patterns
Dynamic Programming (Subset Sum)
1 problems • Practice on LeetCode to earn credits
About This Pattern
Master the Dynamic Programming (Subset Sum) pattern by practicing these problems organized by difficulty.Focus on the Key Signals - these are the indicators that tell you when to use this pattern.
Medium (1)
Target Sum
Count ways to assign +/- to array elements to reach target sum.
Key Signals:
Convert to subset sumFind subset with specific sumDP or memoization