Hash table open addressing

Related Videos:

Data Structures Source Code:

===============================================================================
Developer tools I used in the creation/testing of the content in these videos:

2) Kite, a free AI-powered coding assistant that provides smart code completions while typing:
=============================================================================== ===================================

[shaharnissim]

Awesome videos man.
Your explanations are crystal clear and i'm super greatful for your work

[johanliebert]

Great videos man, i really love your data structures videos . Please also make videos on solving competitive coding problems (like you did previously on some code jam problems) after data structures series.

[anuruddhapremalal]

How can there be a cache miss in a hash table? could you clarify more more about y-axis of the graph shown @2:43?

[sabitkondakc]

Hello William, I always handled my issues with Seperate Chaining Hashing method, could you tell me why we may need open addressing method anyway?

[ashrafmohamed]

@williamFiset why not using a data structure to store the free slots in the hashtable array, and maintain this data structure when a slot get used, or the capacity of the hashtable get increased, so at any point if a hash value (index) is used, we look for the first element in the freeSlot Data structure and use it, then update the freeSlot Data structure to flag that, this element is now in use, etc. I did not try this idea, but is it right conceptually?

[timelrd]

Why can't you just make the size of the hash table, n, a prime number, p, then a linear P with a multiple less than p can't create a cycle?

[yimingchen]

Oh this is a different video lol hahahaha ha my bad lol haha