Subsets II

Medium

Topics
ArrayBacktrackingBit Manipulation

Given an integer array nums that may contain duplicates, return all possible unique subsets. The result may be in any order.

Example 1

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

Example 2

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

Constraints

  • 1 <= nums.length <= 10
  • -10 <= nums[i] <= 10
Run ⌘' · Submit ⌘⏎