We$$ve seen how Hash Tables are an effective means to store and retrieve values. The find in a Hash Table is expected to be O$(1)$ time. To support this, we use a List as the backing data structure and then store $($key$,$ value$)$ pairs in this list by computing the hash of their keys. Unfortunately, there is the possibility of collisions between hashed values. One way to manage that is to use Lists at each index in the array. Keys with the same hash will end up together in these lists within the array.