For each hash value, keep a linked list (also called a chain) of the pairs whose keys map to that value.

When inserting a new key, first compute its hash value, then insert the key at the beginning of the list for that hash value.

When searching for a key, first compute its hash value, then search the list for that hash value.