Collision Handling In Hash Table – Data Structures & Algorithms Tutorials In Python #6

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/data-structures-algorithms-python/tree/master/data_structures/4_HashTable_2_Collisions/4_hash_table_collision_handling.ipynb

Exercise: https://github.com/codebasics/data-structures-algorithms-python/tree/master/data_structures/4_HashTable_2_Collisions/4_hash_table_exercise.md

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

Do you want to learn technology from me? Check https://resources.codebasics.io/4fummw for my affordable video courses.

#datastructures #algorithms #python #HashTable #HashTablealgorithms

Next Video: https://www.youtube.com/watch?v=zwb3GmNAtFk&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=7
Previous video: https://www.youtube.com/watch?v=ea8BRGxGmlA&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=5
Complete playlist:https://www.youtube.com/playlist?list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12

Website: https://resources.codebasics.io/4fummw
Facebook: https://www.facebook.com/codebasicshub
Twitter: https://twitter.com/codebasicshub