Tap here to switch tabs
Problem
Submissions

Problem: Subsets II

Subsets II asks you to return every possible subset of an integer array that may contain duplicate values, ensuring every distinct subset appears once, in any order.

Statement

Given an integer array nums, that can contain duplicate elements,  return all possible subsets while ensuring that each subset is unique. The output must include unique subsets, and you may return them in any order.

Constraints:

  • 1<=1 <= nums.length <=10<= 10

  • −10<=-10 <= nums[i] <=10<= 10

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Subsets II

Subsets II asks you to return every possible subset of an integer array that may contain duplicate values, ensuring every distinct subset appears once, in any order.

Statement

Given an integer array nums, that can contain duplicate elements,  return all possible subsets while ensuring that each subset is unique. The output must include unique subsets, and you may return them in any order.

Constraints:

  • 1<=1 <= nums.length <=10<= 10

  • −10<=-10 <= nums[i] <=10<= 10