Problem
Submissions
Debug

Problem: Find K-Sum Subsets

Statement

Given an array of nn distinct positive integers, find all possible subsets of these integers such that the sum of the elements in each subset equals a given target value k.

Return a 2D array, where each inner array represents a subset whose sum equals k.

Constraints:

  • 1n101 \leq n \leq 10

  • 1x1001 \leq x \leq 100, where xx is any member of the input array.

  • 11 \leq k 103\leq 10^3

Problem
Submissions
Debug

Problem: Find K-Sum Subsets

Statement

Given an array of nn distinct positive integers, find all possible subsets of these integers such that the sum of the elements in each subset equals a given target value k.

Return a 2D array, where each inner array represents a subset whose sum equals k.

Constraints:

  • 1n101 \leq n \leq 10

  • 1x1001 \leq x \leq 100, where xx is any member of the input array.

  • 11 \leq k 103\leq 10^3