أينشتاين مصر (12) || شرح ال Grokking Algorithms - Hash Tables

Welcome to the twelfth video in our "Grokking Algorithms" series on Egypt's Einstein channel! In this episode, we embark on an exciting journey into the world of "Hash Tables," a powerful data structure introduced in Chapter 5 of the book. 📺 Playlist Link:   • أينشتاين مصر || Grokking Algorithms in Arabic   Hash Tables are a fundamental concept in computer science and are widely used for efficient data storage and retrieval. In this part of our exploration, we'll cover the basics of Hash Tables, hash functions, and their essential use cases. We'll begin with an introduction to Hash Tables, providing you with a clear understanding of what they are and why they are crucial in modern programming. You'll discover how Hash Tables allow for fast and efficient data lookup and manipulation. Next, we'll delve into hash functions—the secret sauce behind Hash Tables. You'll learn how hash functions take data and transform it into a unique identifier, allowing for lightning-fast data retrieval. We'll explore the properties of good hash functions and their role in maintaining Hash Table integrity. But that's not all! We'll also explore practical use cases of Hash Tables. You'll see how Hash Tables can be employed for efficient lookups, preventing duplicate entries in databases, and acting as a cache to speed up data access. Throughout the video, we'll provide clear examples and real-world scenarios to illustrate the power and versatility of Hash Tables. You'll gain practical knowledge that you can apply immediately to your programming projects. By the end of this episode, you'll have a solid foundation in Hash Tables, hash functions, and their applications. You'll be well-prepared to dive deeper into the world of Hash Tables in the second part of this series. Join us in this enlightening exploration of Hash Tables, a data structure that will undoubtedly become an invaluable tool in your programming toolkit. If you find this content valuable, please give it a thumbs up, and don't forget to subscribe to our channel for more captivating episodes. Let's continue our journey through data structures and algorithms together! 🚀 ---------------------------------------------------------------------------------------------- محتوي الفيديو:- 00:00​ - مقدمة قناة أينشتاين مصر 00:07 - Intro about Hash Tables 03:10 - Hash tables introduction in the book 11:12 - Details of how hash tables work 23:05 - Example for (SHA1/SHA512) 25:06 - Properties of hash tables 29:17 - How Hashing Algorithm works? 50:40 - Hash functions in the book 01:04:17 - EXERCISES 01:09:39 - Use case (1) Using hash tables for lookups 01:13:27 - Use case (2) Using hash tables for preventing duplicate entries 01:19:20 - Use case (3) Using hash tables as a cache 01:30:48 - Recap 01:35:59 - The End ---------------------------------------------------------------------------------------------- #أينشتاين_مصر #HashTable #HashFunctions #algorithm #GrokkingAlgorithms ╔═.♥. ════════════════════════════════════╗ ＳＵＢＳＣＲＩＢＥ | ＬＩＫＥ | ＣＯＭＭＥＮＴ | ＳＨＡＲＥ | ► Subscribe إشترك ✔    / @einshtenmisr   لاتنسوا الاشتـــــــراك في القنــــاة ✔ ولايـك للفيديو ✔ مشاهدة طيبة أعزائي الكرام ╚══════.♥. ═════════════════════════ #أينشتاين_مصر #Mahmoud_Alyosify https://MahmoudAlyosifySite.github.io/   / einshtenmisr     / mahmoudalyosify   Gmail:[email protected] Yahoo :[email protected]