Problem Submissions Solution

Subset Sums

Difficulty: Medium

Acceptance: %

Points: 30.00

Given a array arr of integers, return the sums of all subsets in the list. Return the sums in sorted order.

Topics

Companies

Articles

Examples:

Expected Time Complexity: O(2^n)

Expected Auxiliary Space: O(2^n)

Constraints:
  • 1 <= arr.size() <= 15
  • 0 <= arr[i] <= 10^4
Companies:
Microsoft Apple Visa Walmart
Topics:
Recursion
Locked Content
Access Restricted: Please Login to access the code editor and test cases.