Hash Tables A data structure that maps keys to values for highly efficient lookup. 1. Compute the key's hash code, usually an int or long. Note that two different keys could have the same hash code, as there may be an infinite number of keys and a finite number of ints 2. Then, map the hash code to an index in the array. This could be done with something like hash(key) % array_length. Two differ..
