Implementing Hashmap in c++(unordered_map) with all functionalities.
Details of the Implementation:
Load Factor = 0.7 (By Default Java uses 0.75 as load factor)
No. of Buckets initially = 11 (Java uses 16 buckets initially)
Bucket[0] is used for 'NULL' value in java.
There cannot be duplications of keys.
TC = O(1) average case for search = O(n) worst case (In case of chaining).