2. Subset Sum
algonotes
lecturenotes
The Problem
- The Subset Sum takes as input an array X of n positive integers and a target Y > 0.
- The output is
YES
if there is a subset of the array X[1 .. n] that sums to Y, andNO
otheriwse.
May 16, 2023
YES
if there is a subset of the array X[1 .. n] that sums to Y, and NO
otheriwse.© 2022 • Neeldhara Misra • Credits •
Corrections? Please leave a comment here or a PR in this repository, thanks!
I’d rather be a failure at something I love than a success at something I hate.
George Burns
You live and you learn — at any rate, you live.
Douglas Adams
A problem worthy of attack proves its worth by fighting back.
Paul Erdos