Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Find All Numbers Disappeared in an Array
Bookmark
Hash Set
Negation Marking
Cyclic Sort
Input
Standard
Simple
All Same
Custom
nums
=
[4, 3, 2, 7, 8, 2, 3, 1]
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
store all values in a set, then check 1..n against it
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
store all values in a set, then check 1..n against it
i
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
seen.add(
2
)
i
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
seen.add(
2
)
already there
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
1
1..n
1
2
3
4
5
6
7
8
set built · check each number 1..n for membership
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
1
1..n
1
2
3
4
5
6
7
8
k
2 in seen?
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
1
1..n
1
2
3
4
5
6
7
8
k
3 in seen?
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
1
1..n
1
2
3
4
5
6
7
8
k
4
is in the set — present
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
1
1..n
1
2
3
4
5
6
7
8
k
missing
5
6 in seen?
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
1
1..n
1
2
3
4
5
6
7
8
k
missing
5
6
7
is in the set — present
4
3
2
7
8
2
3
1
0
1
2
3
4
5
6
7
set
4
3
2
7
8
1
1..n
1
2
3
4
5
6
7
8
missing
5
6
return
[5, 6]
algo
master
.
io
Step:
Store every value in a set, then collect the numbers 1..n it never saw
0 / 26
Input
Standard
Simple
All Same
Custom
nums
=
[4, 3, 2, 7, 8, 2, 3, 1]
0 / 26
algo
master
.
io
Step:
Store every value in a set, then collect the numbers 1..n it never saw
