Skip to content

problem14.md

Latest commit

 

History

History
15 lines (11 loc) · 510 Bytes

problem14.md

File metadata and controls

15 lines (11 loc) · 510 Bytes

Problem 14: The Unique Subset Collector (Subsets II — with Duplicates)

Problem Statement

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 Format

  • An array of integers nums (may contain duplicates).

Constraints

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

Example

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