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
@rohitkhandelwal3132 жыл бұрын
I saw more than 50 videos on hashing , but this was the one which made me actually understand, thankyou sir.
@Javatechie2 жыл бұрын
Thanks Rohit. Keep learning 😃
@PIYUSH-lz1zq Жыл бұрын
bro , if there kar 2 null key then second value will be placed in ??
@rohitkhandelwal313 Жыл бұрын
@@PIYUSH-lz1zq I think 0th bucket
@rohitkhandelwal313 Жыл бұрын
@@Javatechie am I right?
@Javatechie Жыл бұрын
Yes correct
@poojababar87465 ай бұрын
Sidhi bat no bakwas vala explanation, straight, simple , good work sir
@subhamsharma82682 жыл бұрын
That is a very simplified and a splendid explaination of hashmap. Thank you so much sir.❤
@PraveenKumarpksksit10 ай бұрын
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 !!
@gandamraviteja70193 ай бұрын
Great thank you so much just less than 10 mins you cleared lot of things even thanks feels tiny for ur work
@girishrp93393 жыл бұрын
In youtube have more than 1000+ videos same question but your video is very easy to understand.
@Javatechie3 жыл бұрын
Thanks buddy 😊
@maankhurana581411 ай бұрын
Awesome watched 10 more videos on youtube before this .... not able tp understand concept... but u made it very simple ... Thanks alot
@varmamayank2 ай бұрын
Extremely simplified explanation !!
@pateldharmesh136111 ай бұрын
Bhai your tutorial clears all doubts most of the time
@acchutdevkule78412 жыл бұрын
You are one of the underrated tech youtuber ...
@Javatechie2 жыл бұрын
Thanks buddy 🙂 for your word . Will hope to grow soon .
@prajwalbandekar3557 Жыл бұрын
The BEST easy explanation out there, Thank you Sir 🤝
@priyankashaw1238 Жыл бұрын
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.
@Javatechie Жыл бұрын
Okay i will buddy
@sathishkumarr71062 ай бұрын
Thanks bro. It's really helpful for me to understand easily
@trendingthoughts67262 ай бұрын
Super understandable videos..keep doing❤❤❤
@ranjithkumarravichandiran8983 Жыл бұрын
Thank you so much for clear explanation.👏👏
@charangowda3842 жыл бұрын
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.
@Javatechie2 жыл бұрын
Thanks buddy 😊. Glad to hear this ☺️
@NamChics11 ай бұрын
I am subscribing your channel just because of this video
@Javatechie11 ай бұрын
Keep learning 👍 I believe you like other videos as well
@shiva56003 жыл бұрын
Thanks
@Javatechie3 жыл бұрын
Thanks Shiva 😊
@forouzannaderi-vw3sp6 ай бұрын
great explanation thank you so much 😍👏
@raghugupta89592 жыл бұрын
i understand very clear,thanks for explaining neatly🙂🙂
@explorewithme7070Ай бұрын
Very well explained.
@FacundoMartín-z2r Жыл бұрын
Thank you so much for this explanation! It's really clear with the examples you did :D
@rajraj80652 жыл бұрын
Awesome explained, keep making such a good vedio .
@priyay Жыл бұрын
Simple and clear thankyou
@amscoder52623 жыл бұрын
Simply awesome explanation brother 👌👌👌
@Javatechie3 жыл бұрын
Thanks brother 🤗
@sameerkadgaye20482 жыл бұрын
Very clear explanation thank you sir
@subramanianchenniappan40592 жыл бұрын
thanks bro. useful for interviews. i am a java backend restful API project tech lead. will apply for job
@pirate1239 Жыл бұрын
best explanation. easy one
@chetanbhandari30332 жыл бұрын
Awesome explanation waiting more interviews questions videos
@muralitreddy2 жыл бұрын
Simple and neat explain
@supun_sandaruwan10 ай бұрын
All In one video Thank you sir 💖
@kirane5911 Жыл бұрын
Very good explanation
@raghavagarwal6545 Жыл бұрын
Simple awesome explanation👍
@nagireddy15072 жыл бұрын
very clear explanation... Thank you
@vivekkumar-iy7zk9 ай бұрын
Thanks you explained so well
@manamohansamal10403 жыл бұрын
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 🙏🙏
@Javatechie3 жыл бұрын
Okay I will do that. This is kind of URL patterns
@sergiogb2 жыл бұрын
Thanks, good an easy to understand
@PoudelP10 ай бұрын
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?
@Hamza-Shreef Жыл бұрын
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.
@Javatechie Жыл бұрын
No it won't throw any exception just debug and see
@Hamza-Shreef Жыл бұрын
@@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 ❤❤
@PIYUSH-lz1zq Жыл бұрын
bro , if there kar 2 null key then second value will be placed in ??
@Satenc02 жыл бұрын
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
@Javatechie2 жыл бұрын
Yes your understanding is correct
@pranavjog17211 ай бұрын
Hi, Could you please make a video on HashMap internal working in Java 8 or new addition in Java8 for HashMap?
@murugeshk14 Жыл бұрын
Thank u it's was short and simple 🙌
@vinaypandey47522 жыл бұрын
Awesome explination
@pravin.a.mahajan6 ай бұрын
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
@Javatechie6 ай бұрын
That's correct but will cross validate and update you
@raajaakowsalya27112 жыл бұрын
Hey!!! Seriously well explained 😀❤️✨✨
@zuggrr2 жыл бұрын
thank you soooo muchh ! you are the best
@naveenkumardasari9 ай бұрын
It would be more helpful, if you explained about retrieving elements from hashmap.
@Javatechie9 ай бұрын
Will do another video
@ramyasruthi53728 ай бұрын
Thank you!!! Very detailed
@AayushGore-2 ай бұрын
When i thought of this q i thought of receiving answer from java techie. I search on KZbin and first video your name came 😂
@ungalanbuselva2 жыл бұрын
Great explanation
@maheshrevaskar7658 Жыл бұрын
Thanks Basant! Video on working on ConcurrentHashMap will be helpful. Saw many videos, but still its not clear.
@Javatechie Жыл бұрын
Sure i will do that
@basitali96513 жыл бұрын
Thanks for this info..God job sir
@Javatechie3 жыл бұрын
Thanks buddy
@mohammedajazquadri78692 жыл бұрын
brilliant explanation
@pradeepnayak19883 жыл бұрын
Great Work Basant. Keep Growing.
@Javatechie3 жыл бұрын
Thanks buddy
@RaviShankar-xy6zh3 жыл бұрын
Bro you always bring great and interesting videos in eloquent way.
@Javatechie3 жыл бұрын
Thanks buddy 😊
@tirthdalsaniyaАй бұрын
Content is very good, huge room for English improvement is required. Hope you will work on it.
@devopsshiv3842 Жыл бұрын
Yes, i got the internal hashing collision part
@mintybreez2 жыл бұрын
Very well explained 👏
@bhargavarajuthirumalasetty Жыл бұрын
this is simplified. thank ..
@natureParadise7772 жыл бұрын
Like your videos, you explain the topic in very beautiful way, please make more videos on the interview questions...
@Javatechie2 жыл бұрын
Thanks buddy 😊
@rohitchanda84614 ай бұрын
I love this channel's content
@Javatechie4 ай бұрын
Thanks buddy but BTW what is
@rohitchanda84614 ай бұрын
@@Javatechie haha, no, it’s ❤️ thanks for the content!
@AbhijitDixit-ki1oo10 ай бұрын
Thank you so much sir 🙏
@rohitsharma-xt8qe4 ай бұрын
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 ?
@shubhammahindru35632 жыл бұрын
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 ?
@Javatechie2 жыл бұрын
In both the case hashcode will be 1 only right which is again duplicate
@shubhammahindru35632 жыл бұрын
@@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 ?
@praveens22723 жыл бұрын
Nice explanation
@Javatechie3 жыл бұрын
Thanks 😊
@soumyaranjan61963 жыл бұрын
Awesome explanation bro 😊
@Javatechie3 жыл бұрын
Thanks Soumya 😊
@pratishrutipanda64613 жыл бұрын
You nailed it 🔥🔥🔥
@Javatechie3 жыл бұрын
Thanks Pratishruti 🙂
@kishorep55722 жыл бұрын
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);
@Javatechie2 жыл бұрын
Output will be a, C and null , A
@2chottiАй бұрын
Brilliant
@PIYUSH-lz1zq Жыл бұрын
bro , if there kar 2 null key then second value will be placed in ??
@Javatechie Жыл бұрын
Yes
@murugeshk14 Жыл бұрын
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
@ShivaKumarSatakuri2 ай бұрын
Can you explain data retrieval for the same example?
@ranachan55556 ай бұрын
I am not finding you concurrent Hashmap in your list, Please send the link
@sudheergundubogula2 жыл бұрын
Thank you so much ❤️
@MaheshAnand19952 жыл бұрын
Should have been more helpful if you explained the get process as well. Thank you
@Nikhil-jf7lv8 ай бұрын
Welcome to java tikki ❤
@simplyarranged2 жыл бұрын
Thanks sir🎉
@TanishKumar-uz4wk2 жыл бұрын
Great !!!
@tolgacelikart6 ай бұрын
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 ' .
@scoobydooby4672 Жыл бұрын
Nice thanks
@Akhilesh_Reddy3 жыл бұрын
Good one Basant.
@Javatechie3 жыл бұрын
Thanks buddy 😊
@adityavyas66033 жыл бұрын
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..
@Javatechie3 жыл бұрын
If you will do get (key) you will get NPE
@vipintekade64002 жыл бұрын
Lovely .
@VishalSharma-rn7mt Жыл бұрын
Awesome
@mlevidigeri3 жыл бұрын
You’re videos very helpful. Can you please do a video on java events
@Javatechie3 жыл бұрын
Java or spring events ?
@mlevidigeri3 жыл бұрын
@@Javatechie spring events
@Javatechie3 жыл бұрын
Okay I will do that
@mohammedajazquadri78692 жыл бұрын
Sir please make videos on design patterns it is mostly Asking now a days in interview
@Javatechie2 жыл бұрын
Okay buddy I will
@jagadeeshbelagallu52432 жыл бұрын
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?
@priyanaik40992 жыл бұрын
Awesome explanation. Thank you. Can you make video for springboot?
@vinaypandey47522 жыл бұрын
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?
@sivakrishna25449 ай бұрын
Hi bro can you make one vidow difference between 1.7 and 1.8 difference in HashMap internal architecture
@Javatechie9 ай бұрын
Sure will do that
@sivakrishna25449 ай бұрын
Thanks a lot bro❤
@vasuimandi55353 жыл бұрын
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....
@Javatechie3 жыл бұрын
Hi vasu , please check below link it's already there for core java kzbin.info/www/bejne/nHfRppioaKZ3brM
@Javatechie3 жыл бұрын
Part 2 : kzbin.info/www/bejne/fYCZaHZti5J8mLM
@initToLearn2 жыл бұрын
@@Javatechie Thanks
@NSINGHK Жыл бұрын
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
@Javatechie Жыл бұрын
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.
@learnprogramming69302 жыл бұрын
Thank you
@sivarama81162 жыл бұрын
Tx sir
@snehakarosiya26187 ай бұрын
thank you so muchh !!
@aloktiwari41882 жыл бұрын
Hi sir please make video with Java 17 example
@itsnarahari3 жыл бұрын
Bro in which company ur working on ?
@Javatechie3 жыл бұрын
Walmart buddy
@codecompany71142 жыл бұрын
ok good, but what is the importance of Next then?
@saudsiddiqui56982 жыл бұрын
How to access the entry having null key? like map.get("?");
@zsoltgeza Жыл бұрын
You should create captions, because they cannot be created automatically under Your video
@Javatechie Жыл бұрын
Didn't get you buddy
@sivabalarasup7556 Жыл бұрын
I think, he is referring to Subtitles. You could add subtitles.