map from key to array offset
rather than return offset for array, returns pointer for linked list. items in linked list contain key, so if not correct one can go to next in list
Store the key in the bucket. If the key doesn’t match the bucket keep going down until you find it. This can also be used to insert.
Number of entries over number of possible entries.
Performance deteriorates as load factor increases. can be rehashed with more possible entries.