Hash Table Implementation

Objective : To implement a Hash Table

Input:  A set of pairs of keys and values


    • Create a Hash Table
      • Hashtable<Integer, String> ht = new Hashtable<Integer, String>();
    • Insert values in hash table using put(key,value)
      • ht.put(key, value);

  • Get values from hash table using get(key)
    • ht.get(key);
hash table

hash table

Advantage : The search time for any element is O(1) since it uses key to find an element so it takes constant time. But drawback is that it takes extra space.

Complete Code:


All values inserted
Employee with ID 1 is Sumit
Employee with ID 3 is Rishi

Top Companies Interview Questions..-

Google Microsoft Amazon Facebook more..

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

You may also like...

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: