Skip to main content

Subset Sum

Learn Subset Sum (Dynamic Programming, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Does ANY Subset Sum to a Target? A yes/no version of 0/1 Knapsack: dp[i][s] = "can the first i elements form sum s?" - true if EITHER skipping element i already achieves s, OR including element i achieves the remaining s - arr[i] .

More lessons in Dynamic Programming