All Subset Sums
Beginner
Return the sum of every subset of nums (including the empty subset, whose sum is 0), as one sorted list with repeats kept. A list of n values has 2^n subsets.
Examples
Example 1
Input:
all_subset_sums([1, 2])
Output:
[0, 1, 2, 3]
Example 2
Input:
all_subset_sums([])
Output:
[0]
Constraints
0 <= len(nums) <= 16-1000 <= nums[i] <= 1000
Theory
Go to TheoryKeywords
dsa-sheetrecursionrecursive-thinking
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.