HashMap in Java | How HashMap Works in Java | Internal Implementation of HashMap

[@amitsrivastava9162]

From java 8 onwards, when linked list is formed for same index values, after threshold value=8 the linked list restructured into balanced binary tree. So that the complexity is O(log n) as list complexity is O(n) in worst case.

[@nr0913]

nice explanation. simple to understand!!

[@ashrafm3564]

Sahi h boss hat's off

[@vasunttfshimoga]

Very clean and detail explanation!

[@DanielLpz1]

Very helpful and clean

[@karismachoudhury222]

Nice explanation...

[@tadurirk]

Nice explanation thanks

[@nikhiljose2029]

Super explanation

[@Daxbedivlogs]

Nice tutorial .. do you also give live coaching for frameworks , microservices or devops?

[@ByteProgrammingVedantHarish]

@DAX Not yet! Any special topic you are looking for?

[@ByteProgrammingVedantHarish]

@@Daxbedivlogs Sure, i will put some full stack video solutions. Stay tuned!

[@titaneden7825]

InstaBlaster

[@ladeharish5514]

Nice explanation, please do the same for ArrayList and LinkedList. Expecting more videos. Please do more videos by covering all the concepts

[@ByteProgrammingVedantHarish]

Sure ! Stay tuned

[@prabhuchandran8367]

Excellent explanation .. keep going

[@ByteProgrammingVedantHarish]

Glad you liked it

[@ChetanJain1507]

Nice tutorial, thank you.

[@ByteProgrammingVedantHarish]

Glad it was helpful!

[@kevalsheth9639]

Great video! Please make a video on hashCode and equals.

[@ByteProgrammingVedantHarish]

Sure! Stay tuned!

[@at_tap]

very good

[@sergialabartcastro6688]

Does it work with consecutively inputs? For example: ABC = 123 A=1 B=2 C=3

[@ByteProgrammingVedantHarish]

@Sergi I might have understand a bit differently from you about your point. If that's happened, please brief me. How is see HashMap : 1. HashMap works on key-value pair where key needs to be unique. Why unique key? 2. hashcode is calculated from the key and it influences determination of bucket location. Bucket Loc = hashcode & (n-1) Example : For string class, Hashcode calculation = s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1] here s[i] is the character and n is the length. For any custom class : good to implement the hashcode. 3. You might end up with same hashcode, might result in same index and hence collision. Even if you have different hashcode, still might end up at same index, hence collision again. 4. If inserted another value with same key, previous value would be replaced with new value and output of this put operation will be previous value. Above scenario : 1. All keys are unique. So, Insertion of all value to hashmap.

[@sergialabartcastro6688]

Thanks, but I think thai this is not exactly what I meant. When the program is finished I want to introduce some values without gaps and get the keys. Is that possible?

[@ByteProgrammingVedantHarish]

@@sergialabartcastro6688 If not wrong, are we trying to populate data into hashmap in sequential manner? At index0, then 1, then 2 and so on?

[@sergialabartcastro6688]

It is not sequential. You can write all the values you want without gaps

[@ByteProgrammingVedantHarish]

@@sergialabartcastro6688 still not getting "without gaps" . can you describe more or send detailed steps plz, describing what you are trying to achieve.

[@kevalsheth9639]

Waiting for Java Collections Part 2

[@ByteProgrammingVedantHarish]

@Keval Soon it would be available

[@priyagade8788]

Thank you sir

[@ByteProgrammingVedantHarish]

Stay tuned!

[@gowthamchakravarthi6982]

Bro reply me: Index calculation explain comment bro Index = 66 & (15-1) How to calculate bro (&) => symbol what we take bro.

[@ByteProgrammingVedantHarish]

Bitwise and operator