Back to course home
0% completed
Solution: Subsets With Duplicates
Problem Statement
Given a set of numbers that might contain duplicates, find all of its distinct subsets.
Example 1:
Input: [1, 3, 3]
Output: [], [1], [3], [1,3], [3,3], [1,3,3]
Example 2:
Input: [1, 5, 3, 3]
Output: [], [1], [5], [3], [1,5], [1,3], [5,3], [1,5,3], [3,3], [1,3,3], [3,3,5], [1,5,3,3]
Constraints:
1 <= nums.length <= 10
-10 <= nums[i] <= 10
Solution
This problem follows the Subsets
pattern and we can follow a similar Breadth First Search (BFS) approach. The only additional thing we need to do is handle duplicates
.....
.....
.....
Like the course? Get enrolled and start learning!