Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Subsets II
Bookmark
Brute Force
Backtracking
Iterative
Input
Example 1: [1,2,2]
More Duplicates
Single Element
Many Dupes
Custom
nums
=
[1, 2, 2]
sorted nums
0
1
0
2
0
2
try all 2^3 subsets, keep the first of each
result
0
(none yet)
sorted nums
0
1
0
2
0
2
try all 2^3 subsets, keep the first of each
result
0
(none yet)
sorted nums
0
1
0
2
0
2
try all 2^3 subsets, keep the first of each
result
0
(none yet)
mask 0 of 7
0
1
0
2
0
2
subset
[]
→ new
result
1
[]
mask 1 of 7
1
1
0
2
0
2
subset
[1]
→ new
result
2
[]
[1]
mask 2 of 7
0
1
1
2
0
2
subset
[2]
→ new
result
3
[]
[1]
[2]
mask 4 of 7
0
1
0
2
1
2
subset
[2]
→ duplicate, skip
result
4
[]
[1]
[2]
[1,2]
mask 5 of 7
1
1
0
2
1
2
subset
[1,2]
→ duplicate, skip
result
4
[]
[1]
[2]
[1,2]
mask 6 of 7
0
1
1
2
1
2
subset
[2,2]
→ new
result
5
[]
[1]
[2]
[1,2]
[2,2]
mask 7 of 7
1
1
1
2
1
2
subset
[1,2,2]
→ new
result
6
[]
[1]
[2]
[1,2]
[2,2]
[1,2,2]
sorted nums
0
1
0
2
0
2
6 unique subsets
result
6
[]
[1]
[2]
[1,2]
[2,2]
[1,2,2]
algo
master
.
io
Step:
Enumerate every subset; keep the first of each unique one.
0 / 10
Input
Example 1: [1,2,2]
More Duplicates
Single Element
Many Dupes
Custom
nums
=
[1, 2, 2]
0 / 10
algo
master
.
io
Step:
Enumerate every subset; keep the first of each unique one.
