Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given a list of integers, let’s say N1 N2 … Nn, and a given integer X, the problem is put as:
is it possible to select all or some of the integers from the list that the sum of the selected integers equal to X.
I think is should be a common problem that already got a formal “term name”, which is what I’m looking for.
It’s called the Subset sum problem , although technically that is defined in terms of a set rather than a list.