I have seen many videos on this topic but no one explained this topic as simpler and easy as you explained...thank you so much bhagwaan apki har muraad puri kare
Thankyou for so much detailed and simplified way of teaching HashMap. It is really helpful for anyone who wants to either learn fresh or just wants to revise again. Really Appreciate !!
Brother your explanation helps to easily understand the topic. ❤️❤️ One request if you can make a video one interview questions with different types of url mapping to the dispatcher servlet like /,/*,/** etc . It will be very helpful 🙏🙏
Very good explanation sir overall, but I have one little question about the hash collision, at min 5:38 you say that it first uses double equals (==) to check if they have the same hashcode, which means to check if they have the same reference right, if they result to have the same hashcode then it will just replace, but if they dont, then it will check if they have the same value (content) with .equals() method (key1.equals(key2)) right, if it is true then replace, if not then add the next node, is this well understood? please correct me if not
Hi Basant, Recently I got one question from interview that, will it create bucket of 16 when you create map instance? I did debug the code and found that it creates bucket when you first element into map. your explaination at 1:00
5:03 Correct me if I am wrong but if (e1,"Dev") & (e3,"UI") both coincidentally have the same hash value, then wouldn't the hash value for second linked list at 6 be 1011, just like the linked list above it?
5:38 here you said Map first internally used == operator to check the reference and if it is different then it will use equals method. But in the last diagram you haven't showed this ?
@@Javatechie Yes i mean i'm sorry i'm a c# developer and we have a dictionary instead of hash map but i thought they were the same . thank you for pointing that out to me ❤❤
Hi, why is the size is still one ? Car car = new Car("Seletos",2020); Map carMap = new HashMap(); carMap.put(car,"1"); carMap.put(car,"2"); System.out.println(carMap.size()); In car class, I have the following implementation of the equals and hashcode ? @Override public boolean equals(Object o) { return false; } @Override public int hashCode() { return 1; } car.equals(car) will give it false and it should have added it as the next node but its giving the size as 1 and only node its adding ? I am confused in this please help, if u got some time. is it ? if the keys are same then it first checks == if not then only it goes for equals comparison ?
@@Javatechie Yes 1 but it should go and check for equals method which would return false(because of overridden method) and would add the value as next node ? So it means for duplicate keys equals method is also not checked it simply replaces the value ?
Guys, what is the out of it? Map map = new HashMap(); map.put("a", "B"); map.put("a", "C"); map.put(null, "C"); map.put(null, "C"); map.put(null, "A"); System.out.println(map);
if any previous put method has found index position as 0 and its place the value in 0 position and then we are trying to pass map.put(null,"UI"); what will happen in this case?
Very nice explanation Basant... One question if we change the content of employee object after adding as key in map then what happened.. And in case of immutable employee class what is the behavior of map. Thanks in advance..
If u first put(null, 8); its stored in the 0 th index and if again u try to put(null, 9); Then that first entry get replaced by this new entry in the same 0th index as in hashmap duplicate keys are not allowed, if u try to add entry with same key it's gets override
Sir, what will happen, if a duplicate value is given to add, will it will check for duplicate value? Suppose if we have same value in index 1 and same value is send again to add on index 3, it will add or it will not add it?
great explanation , and thanks for sharıng. Just little feedback maybe :) same pronunciation was distracting me time to time on focusing, such as zero (sounds g..), hash (has), etc. also some of saying 'ok , fine, right, after explaning something etc ' .
If put Method find same content what will happen? is it throw error or ignoring to store the content into that object? If e1.equals(e3 is it override e3 content?
It doesn't have linkedlist, it uses resizable array thsts why it fetch in O(1) time, if its linkedList it will fetch map.get(key) in O(n) which is wrong
Hello buddy, It depends on many things. It's usually O(1), with a decent hash which itself is constant time... but you could have a hash which takes a long time to compute, and if there are multiple items in the hash map which return the same hash code, get will have to iterate over them calling equals on each of them to find a match. In the worst case, a HashMap has an O(n) lookup due to walking through all entries in the same hash bucket (e.g. if they all have the same hash code). Fortunately, that worst case scenario doesn't come up very often in real life, in my experience. So no, O(1) certainly isn't guaranteed - but it's usually what you should assume when considering which algorithms and data structures to use. In JDK 8, HashMap has been tweaked so that if keys can be compared for ordering, then any densely-populated bucket is implemented as a tree, so that even if there are lots of entries with the same hash code, the complexity is O(log n). That can cause issues if you have a key type where equality and ordering are different, of course. And yes, if you don't have enough memory for the hash map, you'll be in trouble... but that's going to be true whatever data structure you use.
Bro, can you make a video on mock interviews or can you make video on all common interview questions in Java, So that will be helpful to those who wants to change company....
I have seen many videos on this topic but no one explained this topic as simpler and easy as you explained...thank you so much bhagwaan apki har muraad puri kare
I saw more than 50 videos on hashing , but this was the one which made me actually understand, thankyou sir.
Thanks Rohit. Keep learning 😃
bro , if there kar 2 null key then second value will be placed in ??
@@PIYUSH-lz1zq I think 0th bucket
@@Javatechie am I right?
Yes correct
Sidhi bat no bakwas vala explanation, straight, simple , good work sir
That is a very simplified and a splendid explaination of hashmap. Thank you so much sir.❤
You are one of the underrated tech youtuber ...
Thanks buddy 🙂 for your word . Will hope to grow soon .
Thanks
Thanks Shiva 😊
Bro I have seen a lot of videos , but this is by far the best explanation video i have seen on youtube clean, simple and clear.
Thanks buddy 😊. Glad to hear this ☺️
Awesome watched 10 more videos on youtube before this .... not able tp understand concept... but u made it very simple ... Thanks alot
Thankyou for so much detailed and simplified way of teaching HashMap. It is really helpful for anyone who wants to either learn fresh or just wants to revise again. Really Appreciate !!
Bhai your tutorial clears all doubts most of the time
Your explanation is to the point and very clear. Request you to also add how hashmap retrieval works when there is more than 1 key in the same bucket.
Okay i will buddy
Great thank you so much just less than 10 mins you cleared lot of things
even thanks feels tiny for ur work
Extremely simplified explanation !!
The BEST easy explanation out there, Thank you Sir 🤝
Brother your explanation helps to easily understand the topic. ❤️❤️ One request if you can make a video one interview questions with different types of url mapping to the dispatcher servlet like /,/*,/** etc . It will be very helpful 🙏🙏
Okay I will do that. This is kind of URL patterns
Super understandable videos..keep doing❤❤❤
Thank you so much for posting this sir!
In youtube have more than 1000+ videos same question but your video is very easy to understand.
Thanks buddy 😊
Simple and neat explain
Thank you so much for clear explanation.👏👏
Awesome explained, keep making such a good vedio .
I am subscribing your channel just because of this video
Keep learning 👍 I believe you like other videos as well
great explanation thank you so much 😍👏
Very clear explanation thank you sir
Simple awesome explanation👍
Thank you so much for this explanation! It's really clear with the examples you did :D
best explanation. easy one
i understand very clear,thanks for explaining neatly🙂🙂
Thanks, good an easy to understand
Very good explanation sir overall, but I have one little question about the hash collision, at min 5:38 you say that it first uses double equals (==) to check if they have the same hashcode, which means to check if they have the same reference right, if they result to have the same hashcode then it will just replace, but if they dont, then it will check if they have the same value (content) with .equals() method (key1.equals(key2)) right, if it is true then replace, if not then add the next node, is this well understood? please correct me if not
Yes your understanding is correct
Simple and clear thankyou
Awesome explanation waiting more interviews questions videos
Hey!!! Seriously well explained 😀❤️✨✨
Very well explained.
Simply awesome explanation brother 👌👌👌
Thanks brother 🤗
Very good explanation
very clear explanation... Thank you
All In one video Thank you sir 💖
Hi Basant, Recently I got one question from interview that, will it create bucket of 16 when you create map instance? I did debug the code and found that it creates bucket when you first element into map. your explaination at 1:00
That's correct but will cross validate and update you
Awesome explination
thank you soooo muchh ! you are the best
Thanks you explained so well
5:03
Correct me if I am wrong but if (e1,"Dev") & (e3,"UI") both coincidentally have the same hash value, then wouldn't the hash value for second linked list at 6 be 1011, just like the linked list above it?
Hi, Could you please make a video on HashMap internal working in Java 8 or new addition in Java8 for HashMap?
I love this channel's content
Thanks buddy but BTW what is
@@Javatechie haha, no, it’s ❤️ thanks for the content!
Thanks bro. It's really helpful for me to understand easily
Thank u it's was short and simple 🙌
Great explanation
Thank you!!! Very detailed
Thank you so much sir 🙏
Great Work Basant. Keep Growing.
Thanks buddy
Very well explained 👏
Bro you always bring great and interesting videos in eloquent way.
Thanks buddy 😊
this is simplified. thank ..
brilliant explanation
5:38 here you said Map first internally used == operator to check the reference and if it is different then it will use equals method. But in the last diagram you haven't showed this ?
thanks bro. useful for interviews. i am a java backend restful API project tech lead. will apply for job
5:47
I think if it finds the same reference or the same value it will throw an exception right ?
and there is no replacement happening there.
No it won't throw any exception just debug and see
@@Javatechie Yes i mean i'm sorry i'm a c# developer and we have a dictionary instead of hash map but i thought they were the same .
thank you for pointing that out to me ❤❤
bro , if there kar 2 null key then second value will be placed in ??
You nailed it 🔥🔥🔥
Thanks Pratishruti 🙂
Thanks for this info..God job sir
Thanks buddy
Thanks sir🎉
Great !!!
Yes, i got the internal hashing collision part
Brilliant
Nice explanation
Thanks 😊
Like your videos, you explain the topic in very beautiful way, please make more videos on the interview questions...
Thanks buddy 😊
Awesome explanation bro 😊
Thanks Soumya 😊
When i thought of this q i thought of receiving answer from java techie. I search on RUclips and first video your name came 😂
Awesome
Lovely .
Thank you so much ❤️
Nice thanks
Welcome to java tikki ❤
Hi,
why is the size is still one ?
Car car = new Car("Seletos",2020);
Map carMap = new HashMap();
carMap.put(car,"1");
carMap.put(car,"2");
System.out.println(carMap.size());
In car class, I have the following implementation of the equals and hashcode ?
@Override
public boolean equals(Object o) {
return false;
}
@Override
public int hashCode() {
return 1;
}
car.equals(car) will give it false and it should have added it as the next node but its giving the size as 1 and only node its adding ?
I am confused in this please help, if u got some time.
is it ? if the keys are same then it first checks == if not then only it goes for equals comparison ?
In both the case hashcode will be 1 only right which is again duplicate
@@Javatechie Yes 1 but it should go and check for equals method which would return false(because of overridden method) and would add the value as next node ?
So it means for duplicate keys equals method is also not checked it simply replaces the value ?
Tx sir
Thanks Basant! Video on working on ConcurrentHashMap will be helpful. Saw many videos, but still its not clear.
Sure i will do that
It would be more helpful, if you explained about retrieving elements from hashmap.
Will do another video
Guys, what is the out of it?
Map map = new HashMap();
map.put("a", "B");
map.put("a", "C");
map.put(null, "C");
map.put(null, "C");
map.put(null, "A");
System.out.println(map);
Output will be a, C and null , A
I am not finding you concurrent Hashmap in your list, Please send the link
Good one Basant.
Thanks buddy 😊
if any previous put method has found index position as 0 and its place the value in 0 position and then we are trying to pass map.put(null,"UI"); what will happen in this case?
Very nice explanation Basant... One question if we change the content of employee object after adding as key in map then what happened..
And in case of immutable employee class what is the behavior of map.
Thanks in advance..
If you will do get (key) you will get NPE
Thank you
Can you explain data retrieval for the same example?
Content is very good, huge room for English improvement is required. Hope you will work on it.
bro , if there kar 2 null key then second value will be placed in ??
Yes
If u first put(null, 8); its stored in the 0 th index and if again u try to put(null, 9);
Then that first entry get replaced by this new entry in the same 0th index as in hashmap duplicate keys are not allowed, if u try to add entry with same key it's gets override
Sir, what will happen, if a duplicate value is given to add, will it will check for duplicate value? Suppose if we have same value in index 1 and same value is send again to add on index 3, it will add or it will not add it?
Should have been more helpful if you explained the get process as well. Thank you
great explanation , and thanks for sharıng. Just little feedback maybe :) same pronunciation was distracting me time to time on focusing, such as zero (sounds g..), hash (has), etc.
also some of saying 'ok , fine, right, after explaning something etc ' .
when does the bucket size increase?
When 75% off bucket will be used it wil bel auto grow . That's what load factor
@@Javatechie I see, thank you
thank you so muchh !!
Hi bro can you make one vidow difference between 1.7 and 1.8 difference in HashMap internal architecture
Sure will do that
Thanks a lot bro❤
If put Method find same content what will happen? is it throw error or ignoring to store the content into that object?
If e1.equals(e3 is it override e3 content?
It doesn't have linkedlist, it uses resizable array thsts why it fetch in O(1) time, if its linkedList it will fetch map.get(key) in O(n) which is wrong
Hello buddy,
It depends on many things. It's usually O(1), with a decent hash which itself is constant time... but you could have a hash which takes a long time to compute, and if there are multiple items in the hash map which return the same hash code, get will have to iterate over them calling equals on each of them to find a match.
In the worst case, a HashMap has an O(n) lookup due to walking through all entries in the same hash bucket (e.g. if they all have the same hash code). Fortunately, that worst case scenario doesn't come up very often in real life, in my experience. So no, O(1) certainly isn't guaranteed - but it's usually what you should assume when considering which algorithms and data structures to use.
In JDK 8, HashMap has been tweaked so that if keys can be compared for ordering, then any densely-populated bucket is implemented as a tree, so that even if there are lots of entries with the same hash code, the complexity is O(log n). That can cause issues if you have a key type where equality and ordering are different, of course.
And yes, if you don't have enough memory for the hash map, you'll be in trouble... but that's going to be true whatever data structure you use.
Awesome explanation. Thank you. Can you make video for springboot?
You’re videos very helpful. Can you please do a video on java events
Java or spring events ?
@@Javatechie spring events
Okay I will do that
Sir please make videos on design patterns it is mostly Asking now a days in interview
Okay buddy I will
Bro, can you make a video on mock interviews or can you make video on all common interview questions in Java, So that will be helpful to those who wants to change company....
Hi vasu , please check below link it's already there for core java
ruclips.net/video/fFnuer3AD8Q/видео.html
Part 2 : ruclips.net/video/GO67C7V-IbQ/видео.html
@@Javatechie Thanks
If "key" is null then it will placed at 0th bucket then what if "Value" is also null ?
Bro in which company ur working on ?
Walmart buddy