Subsets II

Medium

Problem

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.

Input: nums = [1,2,2]

Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]

The array contains a duplicate 2. We generate all unique subsets, avoiding duplicates like having two separate [2] subsets.

Input: nums = [0]

Output: [[],[0]]

With a single element, we have two subsets: the empty set and the set containing just that element.

Loading...

Loading Python...