Skip to content

90. Subsets II

Array Backtracking Bit Manipulation

Problem - Subsets II

Medium

Given an integer array nums that may contain duplicates, return all possible subsets (the power set).

The solution set must not contain duplicate subsets. Return the solution in any order.

 

Example 1:

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

Example 2:

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

 

Constraints:

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

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
        def dfs(i: int):
            if i == len(nums):
                result.append(temp[:])
                return 
            temp.append(nums[i])
            dfs(i + 1)
            val = temp.pop()
            while i + 1 < len(nums) and nums[i + 1] == val:
                i += 1

            dfs(i + 1)

        nums.sort()
        result = []
        temp = []
        dfs(0)

        return result

Submission Stats:

  • Runtime: 0 ms (100.00%)
  • Memory: 17.8 MB (84.90%)