Subset Sum Problem
Saurabh Kumar
Director Software Engineering | Startup Owner | Ex Amazon, Walmart | NIT Computer Science
Detect if a subset from a given set of N non-negative integers sums up to a given value S.
Example:
Set: {1, 3, 9, 2}, S = 5
Output: true
Checkout this link for the video on Dynamic Programming solution:
https://www.ideserve.co.in/learn/subset-sum-dynamic-programming
Subscribe for more updates:
https://www.youtube.com/c/IDeserve