Double Hashing for Conflict Resolution in Hash Tables

Build Your Own Redis / DNS / BitTorrent / SQLite - with CodeCrafters.

In the previous videos, I discussed linear probing and quadratic probing to resolve clustered collisions in hash tables. In the sixth video of the series, I explored double hashing as a conflict resolution technique. Double hashing uses two hash functions to find slots for keys, reducing clustered collisions. I also highlighted considerations for choosing a second hash function and the advantages of double hashing, such as uniform distribution and minimal clustering. Stay tuned for more insights on hash table performance optimizations in upcoming videos.

# Recommended videos and playlists

If you liked this video, you will find the following videos and playlists helpful

# Things you will find amusing

# Other socials

I keep writing and sharing my practical experience and learnings every day, so if you resonate then follow along. I keep it no fluff.

Thank you for watching and supporting! it means a ton.

I am on a mission to bring out the best engineering stories from around the world and make you all fall in
love with engineering. If you resonate with this then follow along, I always keep it no-fluff.

[hrishikeshh]

Hi Arpit, I have watched majority of your videos and concept explanations. The level of concept clarity is really commendable.

Can you please elaborate how you assimilate these concepts and very specific knowledge (Terms, mathematical notations, etc) ? There must be some framework(atleast intuitive if not explicitly defined) in your mind while learning all these concepts. Majority of beginners like me face difficulty in directly trying to understand the relevant research papers.

Any insight will be helpful.

[ashishsinghchauhan]

Fast to compute and you are using infinity? Is it?