I started watching your videos several months ago and today I signed up for my first junior job for java spring developer. Thank you so much, you changed my life.
Hey Shabbir, great video. Can you please do a video on comaparator and comparable with examples and usecases, propably how it is asked in interview perspective..
as always very clean n sufficient enough videos .... doubts 1. why dont we use balanced tree in the first place instead of linkedList 2. what is the criteria by which tree is made ...i mean go to left or right 3.. how does hashMap.getKey() works
Purpose of using balance tree later than linkedlist is about the size of the nodes added at specific index of the object created for the hashmap. Dismantling a sub tree of elements that added into balanced tree while deletion of elements in hashmap made, will be faster than removing an element from the linkedlist attached to the index of the object when deletion of elements size is larger. Dirtying the hashmap's elements will be slower when linkedlist size is increased...
Thank you very much Shabbir nice explanation very much helpful please make many more videos on different topics... Congratulations for 50 k subscribers.
Hi great explanation!! please let me know why/when should we override equals and hash code method in Java ? If you have already made a video please give me the link..
Bring a tutorial for rest services because you have posted videose even on microservices but missing about rest service and mvc. Please make a video on it..
I like most of spring boot videos. Do you have any plans for language scala with, spring boot. It helps for data engineer profile like me to build top to end.
Bro here i have doubt in one place while doing get operation you are particular key hashing will happen and return index of the position of key. If its not match that key it will look oneby one node traverse if its not found it will return null value finally. Why we need to check one by one node to traverse and find out that key. If you do find exact key value means why could we can use balance tree logic to find out or some search mechanism to find out immediately not by way of traversing node one by one.
Aren't we getting the index from the key within range of 0 to size-1 after applying hashcode() method, if so, what is hashing doing then, what's the difference between both, please anyone explain...
Hey Shabbir, Great explanation and i have doubt here, why we are using linkedlist in each bucket for storing the nodes,why cant we use simple arraylist?
Array list is the array representation so it doesn't have nodes to connect, where as linked list has nodes which are chained to maintain the links between the nodes.
If the bucket size is more than 64 and one of the particular indexes reaches 8, then only the linked list will get converted to a Balanced tree. Please correct me if I am wrong.
Mannn keep going your vids are amazing please can you make speing boot + angular projects like the ones with react and nextjs and also we need spring integration testing with DB and how to do BDD in spring thank you and keep going
I started watching your videos several months ago and today I signed up for my first junior job for java spring developer. Thank you so much, you changed my life.
Great 👍
Congratulations 🎉
Glad to be small part of your journey ❤️
Great to hear these success stories 🎉
Congratulation Bhai, By watching ur videos only i started by Microservice journey 3 yeears back.
Welcome back 🙂 after this rest period. We missed you DCB - Boss
Thanks buddy 🙏🏻❤️
Great job buddy, congratulations for 50k subscribers. Thank you.
Thanks 🙏🏻
Congrats for 50K subscribers. Good explanation, please post the Angular videos it's very helpful for us.
Thanks 🙏🏻
Nice explanation. Please make a video on working of HashSet and TreeSet. They ask this in interviews for experienced developers.
Great explanation using the Java implementation to show the internals.
Great explanation. Recently started watching your videos. Really enjoying it. Thank you!
Hey Shabbir, great video. Can you please do a video on comaparator and comparable with examples and usecases, propably how it is asked in interview perspective..
sir you are awesome, what a great source of information your channel is, thank you
@Daily Code Buffer Great video, what IDE and Color Theme are you using?
Intellij Idea
Xcode dark theme
Take care of your eye bro... ! :) Kudos to all of your efforts and quality content !
Thanks buddy 🙏🏻
Thanks for asking, now my eye is much better
as always very clean n sufficient enough videos ....
doubts
1. why dont we use balanced tree in the first place instead of linkedList
2. what is the criteria by which tree is made ...i mean go to left or right
3.. how does hashMap.getKey() works
Purpose of using balance tree later than linkedlist is about the size of the nodes added at specific index of the object created for the hashmap. Dismantling a sub tree of elements that added into balanced tree while deletion of elements in hashmap made, will be faster than removing an element from the linkedlist attached to the index of the object when deletion of elements size is larger. Dirtying the hashmap's elements will be slower when linkedlist size is increased...
Congratulations.. please upload Master in microservice and kafka .. thanks in advance
Thanks.... 🙏🙏 Bhai, please make videos on Spring Framework interview questions...
Btw, what happened to your right eye? Looks red
Infection, better now
Thanks for asking
Great Work, and dedication brother, looks like you had the flu and your right eye is red, but you still put the effort and made the video.
Hats off bro !!! the way you explained !!!
Glad to hear that 🙏🏻🙏🏻
excellent explanation. I didn't know about the java 8 hashmap optimization . learnt something new today. :)
🙏🏻❤️
Congrats bro keep going
Thanks 🙏🏻
Thank you very much Shabbir nice explanation very much helpful please make many more videos on different topics...
Congratulations for 50 k subscribers.
Thanks 🙏🏻 ❤️
Congratulations 👏 for 50K .. keep up the good work 👍
Thanks buddy 🙏🏻❤️
Hey Man, As always u will be awesome, finally, I understood. Great Explanation
Thanks 🙏🏻
Congrats shabbir bhai
Thanks 🙏🏻
Excellent explanation 👍👍
Thanks 🙏🏻
Hi great explanation!! please let me know why/when should we override equals and hash code method in Java ? If you have already made a video please give me the link..
Bring a tutorial for rest services because you have posted videose even on microservices but missing about rest service and mvc.
Please make a video on it..
I like most of spring boot videos. Do you have any plans for language scala with, spring boot. It helps for data engineer profile like me to build top to end.
Bro here i have doubt in one place while doing get operation you are particular key hashing will happen and return index of the position of key. If its not match that key it will look oneby one node traverse if its not found it will return null value finally. Why we need to check one by one node to traverse and find out that key. If you do find exact key value means why could we can use balance tree logic to find out or some search mechanism to find out immediately not by way of traversing node one by one.
Back again ❤️❤️❤️
Yes ❤️❤️
Excellant explanation it really helps
Thank you 🙏🏻
Very Good explanation!
Thanks 🙏🏻
Great work man!!
Thanks 🙏🏻
Aren't we getting the index from the key within range of 0 to size-1 after applying hashcode() method, if so, what is hashing doing then, what's the difference between both,
please anyone explain...
Once the size of index increases from 16 , how will hashcode work for same key when it got inserted before and after index size increased?
superb... good explanation...
Thanks 🙏🏻
Hey Shabbir, Great explanation and i have doubt here, why we are using linkedlist in each bucket for storing the nodes,why cant we use simple arraylist?
Array list is the array representation so it doesn't have nodes to connect, where as linked list has nodes which are chained to maintain the links between the nodes.
If the bucket size is more than 64 and one of the particular indexes reaches 8, then only the linked list will get converted to a Balanced tree. Please correct me if I am wrong.
Clearly explained 👍
Thanks 🙏🏻
Very nice explanation.
Thanks 🙏🏻
Thank you very much!!!
Can you please post a video on how to integrate our rest api with splunk and dynatrace
Crisp and clear
Thanks 🙏🏻
Any plan to launch videos related to Data structure and algorithms using java
Planning on it
Awesome bro... :)
Congrats 👏
Thank you 🙏🏻
In this. Vdo which ide used anyone know
Hi bro, please make videos on design patterns.
Great video
Thanks 🙏🏻
I want to learn java from you please ❤️
Could you do a video on scala language with spring boot
I will plan on it
Thank you brother
Good video lesson
Thanks 🙏🏻
Great vedio
Thanks 🙏🏻
@@DailyCodeBuffer Watching you java interview Question playlist.
Please detailed vedio of each and every class in collections Framework
Bhaiya one request Ak long one go video for java and DSA course can we except bhaiya ????plsssss
Mannn keep going your vids are amazing please can you make speing boot + angular projects like the ones with react and nextjs and also we need spring integration testing with DB and how to do BDD in spring thank you and keep going
Please change IDE background to white for clear picture🖼️
Cann u say which ide he used
@@debiprasaddash654 intellj
Course about KStreams, bro.
I need java 8 feature video
null shouldn't be in " ".
Please make on microservices don't waste time on already existing tutorials
Bro take care of your eye
Thanks
Nhi samjha bhai