Learn
Practice
Newsletter
Resources
F
Toggle theme
0
F
Toggle theme
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)
Hash Table (size 11)
0
EMPTY
1
EMPTY
2
EMPTY
3
EMPTY
4
EMPTY
5
EMPTY
6
EMPTY
7
EMPTY
8
EMPTY
9
EMPTY
10
EMPTY
algo
master
.
io
Step:
Design HashMap using open addressing with linear probing
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
Hash Table (size 11)
0
EMPTY
1
EMPTY
2
EMPTY
3
EMPTY
4
EMPTY
5
EMPTY
6
EMPTY
7
EMPTY
8
EMPTY
9
EMPTY
10
EMPTY
algo
master
.
io
Step:
Design HashMap using open addressing with linear probing
