CareerCup

I would keep the dictionary in a trie ... lookup the prefix in the trie for all three letters whenever a key is pressed ...

I would keep the dictionary in a trie ... lookup the prefix in the trie for all three letters whenever a key is pressed ...

Prefect... trie is the solution

Try suffix tree

We can also use a hash map for the same. For each combination of the number, store it as a key and store all the associated words in the bucket in a link list. Whenever a user types those button, give the first of the words in the bucket as the o/p. If user inserts its own words then keep that word as the first one in the bucket.

isn't hashmap on a cellphone too computation-intensive?..

Trie