Hashing and hash tables crash course (+ face reveal) - Inside code скачать в хорошем качестве

Hashing and hash tables crash course (+ face reveal) - Inside code

Source code: https://gist.github.com/syphh/00b889c... 🔴 Learn graph theory algorithms: https://inscod.com/graphalgo ⚙ Learn dynamic programming: https://inscod.com/dp_course 💡 Learn to solve popular coding interview problems: https://inscod.com/50problems_course ⌛ Learn time and space complexity analysis: https://inscod.com/complexity_course 🔁 Learn recursion: https://inscod.com/recursion_course NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks! NB2: Discounts of courses above are permanent I also post content on LinkedIn (https://inscod.com/linkedin) and Instagram (https://inscod.com/instagram) Chapters: 00:00 Introduction 00:59 What is hashing? 02:30 What is a hash table? 03:08 What is a hash function? 05:05 Some hash table applications 05:55 Hash table operations example 06:58 What is a collision? 07:18 Collision handling: Separate chaining 09:24 Collision handling: Open addressing 10:37 Can we have no collisions? 13:46 What is rehashing? 16:14 Is the hash function we made good? 18:23 Recap 20:41 Why would we use a hash table? 21:21 Space complexity analysihttps://inscod.com/complexity_course 22:35 Let's implement a hash table 27:36 Time complexity analysihttps://inscod.com/complexity_course 33:36 Load factor impact on time/space efficiency 34:29 Coding problem example: Two sum 34:58 Uniqueness and immutability of keys and values I also post content on LinkedIn (https://inscod.com/linkedin) and Instagram (https://inscod.com/instagram)