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)
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.
All values inserted Employee with ID 1 is Sumit Employee with ID 3 is Rishi
Top Companies Interview Questions..-
If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.