I have some confusion with respect to the working of Hashmap.
What is know about the working of a hashmap is that when a hashmap is created a array of linked list is created i.e. each element that is added to the hashmap the hashcode is calculated of the key object that hashcode is the index in the array at which the element would be added to the linked list.
My doubt here is that suppose i have some code where i am adding 2 objets to a hashmap one hashmap returns returns the hashcode 1 and the element will be added to the linked list at index - 1. Now if i am adding another element whose hashcode returned is suppose INT.max_value or very large number so will the array of linked list be of size this much (INT.max_value or very large number) ??