Given an array of n 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:
1≤n≤10
...
⋮
Problem
Submissions
Solution: Find K-Sum Subsets
Statement▼
Given an array of n 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.