This is an attempt to come up with my own hashmap in java. It serves all basic needs of original java.util.HashMap with O(1) complexity in read operations.
To look into the internals of java.util.HashMap itself, see here
Output is ‘SMTS1’ which says when key is duplicated, it is getting replaced.
To cross verify the concept like collisions we need to choose the user defined key instead of ‘String’, I hope one can take it further from here on 🙂
Iamsocurious 