Collision Handling In Hash Table


Collisions in hash table can be handled using separate chaining or linear probing (also known as open addressing or closed hashing). We will cover these two techniques in this tutorial and then implement hash table class in python using separate chaining. Hash map or hash table is a very popular data structure. It allows to store key, value pairs and using key you can locate a value in O(1) or constant time. 

Code: https://github.com/codebasics/py/blob/master/DataStructures/4_HashTable_2_Collisions/4_hash_table_collision_handling.ipynb

Exercise: https://github.com/codebasics/py/blob/master/DataStructures/4_HashTable_2_Collisions/4_hash_table_exercise.md

Topics
03:42 Implement chaining in python
00:33 Separate chaining
02:37 Linear probing
03:42 Python implementation
15:38 Exercise