algorythms
Subsets / Combinations
LC #90Medium

Subsets II

Subsets / Combinations
AmazonGoogleMeta

Problem

Return all possible subsets of an array that may contain duplicates. No duplicate subsets.

arraybacktracking

Constraints

  • 1 ≤ n ≤ 10
  • -10 ≤ nums[i] ≤ 10
  • May contain duplicates

Example

Inputnums = [1, 2, 2]
Output[[], [1], [1,2], [1,2,2], [2], [2,2]]
Why

Duplicates exist; output must not contain duplicate subsets

Hints — reveal one at a time