Learn
Practice
Newsletter
Resources
Animations
New
F
Toggle theme
0
F
0
Toggle menu
← Back to All Animations
Design HashMap
Bookmark
Input
Put, Get, Remove
Collision + Tombstone Reuse
Update + Re-insert
operations
=
put(1, 10), put(2, 20), get(1), put(12, 30), get(12), remove(1), get(1)
put(1, 10)
put(2, 20)
get(1)
=
?
put(12, 30)
get(12)
=
?
remove(1)
get(1)
=
?
0
1
2
3
4
5
6
7
8
9
10
hash the key to a slot · probe forward on collision
algo
master
.
io
Step:
Open addressing: hash each key to a slot, probe forward on collision
0 / 43
Input
Put, Get, Remove
Collision + Tombstone Reuse
Update + Re-insert
operations
=
put(1, 10), put(2, 20), get(1), put(12, 30), get(12), remove(1), get(1)
0 / 43
put(1, 10)
put(2, 20)
get(1)
=
?
put(12, 30)
get(12)
=
?
remove(1)
get(1)
=
?
0
1
2
3
4
5
6
7
8
9
10
hash the key to a slot · probe forward on collision
algo
master
.
io
Step:
Open addressing: hash each key to a slot, probe forward on collision
