First, if you have a set of unique usernames, those could be used to
be keys. How to generate hash is depends on your requirements. You can
add a few prefix chars or postfix
On Sep 30, 2:45 pm, amit amitjaspal...@gmail.com wrote:
Design a hash table to store phone #s. Your job is to write a hash
Use a trie, the memory needed will be less than having a list of
strings and it will be faster than hashTable (array implementation of
trie). Check Trie in Wikipedia. If the datastructure is going to be
static, then using a Directed acyclic finite automata (dafsa) may be
even better.
On Sep 30,
