No matter what the problem is, it's always a people problem. Gerald M. Weinberg
Dictionary is an abstract data type composed of a collection of keys and values. The Dictionary does not take duplicate keys and must write to handle collisions that occur when two keys are mapped to same index.
Write a program to look up the item from the hash tables. Value can be duplicated and keys should not duplicate.
Items in the dictionary: [Helo,Hello,Hllo,Hellosiva,HelloWorld,] Search 'Hello' string from the dictionary: Hello (1 words)