With 1 good hash function, how can I create a static hash table for N distinct keys that is collision free? I know the keys in advance, so the hash table doesn't have to be resized (hence it is static).
Related question: will it always be possible to find a hash table with no collisions?