reference:
It seems that this is a must-question for Java development interviews?
Learn with these questions:
- Data structure realization of HashMap
- How does HashMap provide stable time complexity for get and put operations?
- When did HashMap change from a single node to a linked list and when did it change from a linked list to a red-black tree?
- Why give a custom initial capacity when HashMap is initialized.
- How does HashMap ensure that the capacity is always a power of 2
- Why does HashMap ensure that the capacity is always a power of 2
- How to calculate the hash value of HashMap
- Why is HashMap thread unsafe
When we do not know the index, the complexity is very high, but when we know the index, the complexity is O(1) level