Find K-Sum Subsets

Try to solve the Find K-Sum Subsets problem.

Statement

Given a setA set is a collection of distinct objects. of nn positive integers, find all the possible subsets of integers that sum up to a number k.

Constraints:

  • 1n101 \leq n \leq 10
  • 1x1001 \leq x \leq 100, where xx is any member of the input set
  • 1k1031 \leq k \leq 10^3

Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy