00:05 Introduction to HashMap & HashTable in Java 02:06 Hashmaps provide a way to search for elements in constant time. 06:43 HashMap in Java is a key-value pair data structure that allows fast retrieval of values based on their keys. 09:12 HashMap and HashTable are used in various areas such as programming languages, network routers, virtual memory, cryptography, and string search. 14:58 Introduction to HashMap & HashTable in Java 17:36 In Java, hash code is a method used to convert a string or number into a unique integer value. 22:34 Hashing is used to reduce large numbers to fit within a predefined range. 24:52 Collision in HashMap and HashTable occurs when multiple indices have the same hash code. 29:39 Assumption of simple uniform hashing for equal likelihood of keys being hashed to any slot in the table. 32:04 The hash function used is k modulo m. 37:41 Understanding the universal hashing method 40:23 The size of the table should be dynamically adjusted based on the number of elements. 45:29 Inserting elements in a HashMap has an average constant time complexity of O(n) 48:51 Open addressing is a method to prevent collisions in HashMap & HashTable. 54:07 Double hashing is used to avoid clustering in hash tables. 56:56 Hashmaps in Java: Understanding the internal workings of hashmaps 1:02:17 Open addressing is efficient in terms of cache performance and memory usage 1:05:06 Open addressing in HashMap degrades past 70% due to clustering and array size reduction. 1:09:39 Introduction to HashMap & HashTable in Java 1:13:30 HashMap vs HashTable in Java 1:18:38 Introduction to HashMap & HashTable in Java 1:21:31 HashMap can be used to remove a key from the map. 1:28:18 Introduction to HashMap & HashTable in Java 1:31:29 Understanding the basic operations of HashMap and HashTable in Java 1:37:28 Introduction to HashMap & HashTable in Java 1:39:30 HashMap and HashTable are important data structures in Java. --------- Definitely his way of teaching lets the topic sink-in in much better way, here are some timestamps.
8:45 Applications of hashmaps so that lookup is in O(1) 1) Symbol Table {a table where each variable is pointed to its data type and the value in short} (in compilers {C++, Java} and interpreter {Python, JS}) 2) Network Routers {routing the IP addresses} , Port to IP binding 3) Cryptography 4) String search (grep command)
I don't think stuff like this is used in development on a daily basis DSA and Leetcode help you learn how to think like a programmer and are needed to clear interview rounds in big tech companies, but you will not really be inverting binary trees all day once you get a job as a SWE
Wow, Kunal! Your DSA playlist is absolutely phenomenal. The way you've explained each topic with such clarity and depth is truly commendable. This playlist is hands down one of the best resources for learning DSA on UA-cam. I've been following it for the past two months, and it has been incredibly helpful! However, I noticed that dynamic programming and graphs are yet to be covered. Could you please consider adding these topics? Completing them would make this course the ultimate DSA resource on UA-cam. Thank you so much for your hard work and dedication🙌🤝!
is this a live video?......people take 100s of cuts in their video to give the content and you are making a lecture live and the content you provide is really so top notch...................really need your type of mentor on this platform....................you are really great kunal bhaiya......................your content is far more better than millions subscriber youtube channel........................i save my 100s of hours by seeing your lectures....................hope you continue this great work of spreading knowledge🙌🙌🙌🙌🙌🙌🙌🙌😊😊😊😊😊😊
Nice lecture lot of new things learnt from this lecture good👍 ahead bro and share your knowledge📚. It's very helpful for students who are curious about learning DSA stuffs
BHAIYA on a serious note your videos are seriously means seriously great but bhiaya plz as a freasher its almost impossible to chose which topic to learn first can you plz prepare a road map for this playlist on java + dsa plzzz please note this bhaiya
Starting with an Empty Binary Search Tree(BST),create a BST by reading the values in the given Order and perform following operations on it: 1. Insert a new node 2. Perform Inorder, Preorder And Postorder Traversals 3. Search 4. Delete 5. Height 6. Mirror Image 7. Find Smallest and Largest Element . In this question we implemented some operation but some are left such as mirror image, Height , Find Smallest and Largest Element .
Hey Kunal, I'm watching and learning from your DSA course. But, unable to find your Dynamic Progamming content/series. Can you please share the playlist link for Dynamic Programming ?
Bro I really don't think he'll make those videos we need to refer some other Java Coding channels, if you get it please share it here, but Kunal Kushwaha's DSA is amazing it's missing only dp and graphs
consider following questions please Implement a program to represent a graph using adjacency matrix and adjacency list, compute DFS and BFS of the same
@KunalKushwaha I had one doubt that when we are trying to perform put operation and when our size / list.size > lf we are trying to rehash so the current item that we are trying to put will never be added to the original list ?
Hii, I am studying this DSA course from Canada🇨🇦 and I am in high school right now, I have one question that after completing this Java DSA course do I need to learn anything more to get ready for a job?? I need some guidance, Pls be helpful 😊
Please make video on graph Graph : Concept and terminologies, Graph as an ADT, Representation of graphs using adjacency matrix and adjacency list, Breadth First Search traversal, Depth First Search traversal, Prim’s and Kruskal’ algorithms for minimum spanning tree, Shortest path using Dijkstra's algorithm. Hash Table: Hash Table- Concepts-hash table, hash function, bucket, collision, overflow, open hashing, closed hashing, perfect hash function, hash functions- properties of good hash function, division, multiplication, extraction, mid-square, folding and universal, Collision resolution strategies- open addressing and chaining without replacement, open addressing and chaining with replacement. Multiway Trees: B-Tree, B+ Tree. please make videos on above topic only those topic left in DSA. please
DSA + interview preparation playlist: ua-cam.com/play/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ.html
00:05 Introduction to HashMap & HashTable in Java
02:06 Hashmaps provide a way to search for elements in constant time.
06:43 HashMap in Java is a key-value pair data structure that allows fast retrieval of values based on their keys.
09:12 HashMap and HashTable are used in various areas such as programming languages, network routers, virtual memory, cryptography, and string search.
14:58 Introduction to HashMap & HashTable in Java
17:36 In Java, hash code is a method used to convert a string or number into a unique integer value.
22:34 Hashing is used to reduce large numbers to fit within a predefined range.
24:52 Collision in HashMap and HashTable occurs when multiple indices have the same hash code.
29:39 Assumption of simple uniform hashing for equal likelihood of keys being hashed to any slot in the table.
32:04 The hash function used is k modulo m.
37:41 Understanding the universal hashing method
40:23 The size of the table should be dynamically adjusted based on the number of elements.
45:29 Inserting elements in a HashMap has an average constant time complexity of O(n)
48:51 Open addressing is a method to prevent collisions in HashMap & HashTable.
54:07 Double hashing is used to avoid clustering in hash tables.
56:56 Hashmaps in Java: Understanding the internal workings of hashmaps
1:02:17 Open addressing is efficient in terms of cache performance and memory usage
1:05:06 Open addressing in HashMap degrades past 70% due to clustering and array size reduction.
1:09:39 Introduction to HashMap & HashTable in Java
1:13:30 HashMap vs HashTable in Java
1:18:38 Introduction to HashMap & HashTable in Java
1:21:31 HashMap can be used to remove a key from the map.
1:28:18 Introduction to HashMap & HashTable in Java
1:31:29 Understanding the basic operations of HashMap and HashTable in Java
1:37:28 Introduction to HashMap & HashTable in Java
1:39:30 HashMap and HashTable are important data structures in Java.
--------- Definitely his way of teaching lets the topic sink-in in much better way, here are some timestamps.
A very talented teacher with no haters
😂😂
Once he started teaching dsa chabbar,babber, driver all started hating him beacuse of obvious reason they cannot match his teaching standard
Kunal is not just a mentor he is person who help us to achieve our goals without any fake suggestions.
He is the guy who can compromise with setup but not with quality of content and explanation 💫💫💫
8:45 Applications of hashmaps so that lookup is in O(1)
1) Symbol Table {a table where each variable is pointed to its data type and the value in short} (in compilers {C++, Java} and interpreter {Python, JS})
2) Network Routers {routing the IP addresses} , Port to IP binding
3) Cryptography
4) String search (grep command)
Kunal bhaiya one request while making these DSA videos also mention 3-4 projects in which these data structure has helped you and how😊
I don't think stuff like this is used in development on a daily basis
DSA and Leetcode help you learn how to think like a programmer and are needed to clear interview rounds in big tech companies, but you will not really be inverting binary trees all day once you get a job as a SWE
When He teaches things gets simpler !
Thanks Kunal Bro!
Thanks a lot kunal Bhaiyya ❤
Please increase the pace of this course because we are getting paused while learning due to long gaps of new videos
Please Complete DSA as soon as possible
Wow, Kunal! Your DSA playlist is absolutely phenomenal. The way you've explained each topic with such clarity and depth is truly commendable. This playlist is hands down one of the best resources for learning DSA on UA-cam. I've been following it for the past two months, and it has been incredibly helpful! However, I noticed that dynamic programming and graphs are yet to be covered. Could you please consider adding these topics? Completing them would make this course the ultimate DSA resource on UA-cam. Thank you so much for your hard work and dedication🙌🤝!
Best best best course even paid course can't beat this DSA course ❤❤❤
This video come out at 2 Am in India
And I am gonna watch it in 2 am
mention in ur cv
@@hardikraichura9123 😂
One of the best Data structure TBH. The versatility of hashmaps is insane.
Had been waiting for this kunal bhai..thank you very much❤
simple, very easy, very simple stuff
You are just amazing kunal really i dindt understood dsa in my college better than here
Thanks for teaching us for free, explaining the complex concept with simple & easy approach.
Thanks a lot Kunal vi for giving video again🔥Love from Bangladesh💙
King Uploaded His DSA VIDEO AT 2 AM 🥷❤️🔥
#DSAWithKunal
Bro he lives in London so he didn't upload this video at 2 AM
Thank you sir for uploading the video ❤
46:04 I have a doubt when doubling the size of hashmap how is O(1+2+4+8...n) becomes O(n)
Watch time complexity lecture
Constants and less dominatings are ignored
Sum of all powers of 2 up to N can be calculated as 2 log2(N) + 1 - 1.
In this remove the constant value
@@ajitupadhyay3744 Hey I started coding this year should I start dsa ?
@@ajitupadhyay3744 still how can you remove the exponent 2^log2(N) ?
Thank you so much Kunal da,for uploading the rest parts gradually.
is this a live video?......people take 100s of cuts in their video to give the content and you are making a lecture live and the content you provide is really so top notch...................really need your type of mentor on this platform....................you are really great kunal bhaiya......................your content is far more better than millions subscriber youtube channel........................i save my 100s of hours by seeing your lectures....................hope you continue this great work of spreading knowledge🙌🙌🙌🙌🙌🙌🙌🙌😊😊😊😊😊😊
Bro I have been waiting for this video or a longtime ,this video push my motivation to a new level
Thank you so much for helping with these awesome work. Best course!!
I love watching your videos, bro. Thank you so much for providing excellent content !!!!!!
I was just searching for Hashing from Kunal. Dint found the video and now he uploaded it 😂
This is soooooo complicated and difficult to understand 😭😭😭😭
+1
+1
++++
-1
the mere fact that you got 88/100 and you didn't consider that a good grade, shows the level you are at, god tier
Thanks a lot Man!
Nobody expected that you'll upload 3-4 videos together....
Hats off to your efforts🫡🫡
Thanks for still doing it. We are lucky to have you
Impressive teachings!!!
FINALLLLLYYYYYYYYYYYY
Excellent Sir!
Keep teaching Sir🤲
Helpful, Radhe Radhe
Waiting for next Video ❤ this was lit🔥🔥🔥as always!
21:56 first time i saw kunal make tease others 😂
The Messiah of dsa for beginners❤
Great Lecture Loved it......
35:00
Division
Multiplication
Universal
Nice lecture lot of new things learnt from this lecture good👍 ahead bro and share your knowledge📚. It's very helpful for students who are curious about learning DSA stuffs
great teacher ..respect from syria🧡
you are the best kunallllll
Thanks bro... been waiting for it since long time
Thank you bhaiya ! for such an amazing lecture.
BHAIYA on a serious note your videos are seriously means seriously great but bhiaya plz as a freasher its almost impossible to chose which topic to learn first can you plz prepare a road map for this playlist on java + dsa plzzz
please note this bhaiya
just follow the playlist order
great course .....🫶
Starting with an Empty Binary Search Tree(BST),create a BST by reading the values in the given
Order and perform following operations on it: 1. Insert a new node 2. Perform Inorder, Preorder
And Postorder Traversals 3. Search 4. Delete 5. Height 6. Mirror Image 7. Find Smallest and
Largest Element .
In this question we implemented some operation but some are left such as mirror image, Height , Find Smallest and
Largest Element .
Hey Kunal, I'm watching and learning from your DSA course. But, unable to find your Dynamic Progamming content/series.
Can you please share the playlist link for Dynamic Programming ?
mind boggling but great stuff
please make video on graph and DP
21:55 where he trolls the over smart people is just too funny 😂
Thanks sir ❤ pls come with dsa series
Superb 🎉
I love this man so much
Thanks a lot Kunal. Your videos helped me a lot!
Hi Kunal do you have a video on Dynamic Programming
was waiting for it love your video Kunal
Thank you soo much❤
Thank you for the playlist, came way to far with the playlist and waiting for graphs and DP to grasp the knowledge.😄
Bro I really don't think he'll make those videos we need to refer some other Java Coding channels, if you get it please share it here, but Kunal Kushwaha's DSA is amazing it's missing only dp and graphs
Finnally finnally finnally finnally FINNALLYYYYY 😭
thank you
Appreciate your efforts Kunal. 🙌
Great Video!
Amazing video
Thank you kunal bro❤
Thank you bro🙌
Amazing
Tysm!!🙏
Thank you bro.
Good one
consider following questions please
Implement a program to represent a graph using adjacency matrix and adjacency list, compute
DFS and BFS of the same
Thanks you so much bro
The real G.O.A.T 🔥
@KunalKushwaha I had one doubt that when we are trying to perform put operation and when our size / list.size > lf
we are trying to rehash so the current item that we are trying to put will never be added to the original list ?
Hii,
I am studying this DSA course from Canada🇨🇦 and I am in high school right now,
I have one question that after completing this Java DSA course do I need to learn anything more to get ready for a job??
I need some guidance,
Pls be helpful 😊
You should do development also...
Thanks a lot for ur helpful reply😊👍
kunal please make one practice leetcode questions video on hasmaps needed
Great video as usual
Let's gooo
please anyone provide the documentation that the sir is following here
does Interviewer asks implementation ?? im a beginner please reply
Yes
how do i get this documentation ?
Please make video on graph
Graph : Concept and terminologies, Graph as an ADT, Representation of graphs using adjacency matrix
and adjacency list, Breadth First Search traversal, Depth First Search traversal, Prim’s and Kruskal’
algorithms for minimum spanning tree, Shortest path using Dijkstra's algorithm.
Hash Table: Hash Table- Concepts-hash table, hash function, bucket, collision, overflow, open hashing,
closed hashing, perfect hash function, hash functions- properties of good hash function, division,
multiplication, extraction, mid-square, folding and universal, Collision resolution strategies- open addressing
and chaining without replacement, open addressing and chaining with replacement. Multiway Trees: B-Tree,
B+ Tree.
please make videos on above topic only those topic left in DSA. please
Hey! Kunal I thought the next video you said would be of questions of binary tree
I have posted that already and advance one will come as well
With all due respect, When this series will be completed? It’s almost 2 years since the series was started
@@KunalKushwaha plz upload advance binary tree question
where his setup gone? :/
Hello, on the notepad please write on dark paper with a white ink.
DSA ka gunda Kunal ❤
where is the interview questions of hashmap vidieo anybody tell
kunal bhaiya please upload questions video
❤❤❤
finally u r back
🖤👌
Kunal can you please make a video on nested collections please!!!
nice
2am show💯❤️
22:00 amortized constant time
25:48: collision resolve: chaining---
30:30 simple uniform hashing
41:23 size of table
47:07 amortized/average constant time explained
50:00 collision resolve-open adressing
Chaining and Open addressing part was so blurry for me. I am just feeling overwhelmed for it.
Please upload DP video
Waiting for Advanced Tree questions and DP....❤