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.

Leetcode link

Examples

Example 1:

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


Example 2:

Input: nums = [0]
Output: [[],[0]]

Constraints

• 1 <= nums.length <= 10
• -10 <= nums[i] <= 10
• All the numbers of nums are unique.

Code

Python3 Code

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:

        res = []



        def dfs(i,subset):
            if i>=len(nums):
                res.append(subset)
                return

            dfs(i+1,subset+[nums[i]])

            dfs(i+1,subset)

        dfs(0,[])

        return res