You have a fixed list of words, construct a data structure to achieve efficient (O(1) time complexity) prefix lookup. Write code to implement the lookup. For example, the result of looking up "app" is {apple, applications, ...}
Sigiloso
User Trie Datastructure