A perfect hashing function that maps each different key to a distinct integer and has the same number of possible integers as keys. Formal Definition: A function f is a minimal perfect hash function for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k and the range of f(k) is 1...