NP-Complete refers to the hardest known problems within the complexity class NP
In computer science, the subset sum problem is one of the important problems in complexity theory and cryptography.
|Problem hard more||
"The subset-sum problem is hard more precisely it s np-complete which means that your variant is hard too it s not np-complete because it s not a decision problem but it is np-hard"
from question "Distinct sub sequences summing to given number in an array"