← Back to problems Anduril • design / hashing

Design Hash Map

AeroSpace • Anduril • chaining collision resolution

Build your own hash map: put / get / remove. Index with key % B, resolve collisions via separate chaining (linked lists per bucket). Telemetry ID → state store flavor.

AvgO(1)

WorstO(n)

Buckets8

Active bucket

Chain node

Collision / update

op—

bucket—

result—

Speed:

Ready

Press Play. Watch puts collide into the same bucket and chain.

Whiteboard

Size:3

Type It

class MyHashMap with put(key, value), get(key) → value or -1, remove(key). Use chaining.

═══ DESIGN HASH MAP ═══

PATTERN ▸ Array of buckets + chains

① buckets = [[] for _ in range(B)]

② i = key % B

③ put: scan chain → update or append

④ get / remove: scan chain for key

collision = same bucket, longer chain

your implementation

Verify: