You can't find a solution online for it that doesn't run in polynomial time complexity, when using dynamic programming. Have all these sites secretly solved P=NP, and no one knows about it?
How is the Subset Sum Problem NP-Complete?
algorithms;complexity theory;np complete;np