Skip to content

problem3.md

Latest commit

 

History

History
15 lines (11 loc) · 464 Bytes

problem3.md

File metadata and controls

15 lines (11 loc) · 464 Bytes

Problem 3: The Subset Architect (Subsets)

Problem Statement

Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order.

Input Format

  • An array of distinct integers nums.

Constraints

  • 1 <= nums.length <= 10
  • -10 <= nums[i] <= 10

Example

Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]