Try to store each element at an index corresponding to its hash
Resolve collisions with linear probing: if a spot is filled, try the next
The Robin Hood strategy: store each element's displacement from its initial index. When elements collide, move the one with lower displacement (with tiebreakers based on data).