Conflict Resolution in Hash Tables with Open Addressing

[@sarcaastech]

does here soft deletion of the key means that we just flag the key to be deleted instead of actually removing it ?

[@AsliEngineering]

Yes

[@shantanutripathi]

Quality of Content + Delivery Both are awesome. I'm not sure why 12k only :(

[@d4devotion]

He is moving like a rocket, so will increase it sometime.

[@mujtabajafri2803]

pure CS

[@5590priyank]

How do we generate permutations for each slot?

[@88anand1]

Very good quality content.

[@nagesh007]

Awesome 😍

[@VipulVaibhaw]

This is great, I have asked a lot of candidates about conflicts very few people can answer them, A lot of people say it doesn't ever happen at all. A request, please make a video on distributed data structures, distributed hashmaps.

[@nipunsinha7445]

Hi Arpit, I have a doubt - how does the probing function ensure that the indexes are not repeated and we are able to iterate over all the m slots? Like when you mentioned : j = p(k,0), if that is occupied j = p(k,1), if that is occupied j = p(k,2), if that is occupied .... j = p(k,m-1), if that is occupied how do we ensure that the j's that we see in the ith attempt have not been seen in the 0th to (i-1)th attempt?

[@d4devotion]

Very well explained in depth especially that soft delete concept, I did not know that. But there are couple of things you missed In probing (Might be you will be having this in future video) - The first thing is time complexity to add/lookup/delete (For example the lookup is not now O(1), it can be O(n) worst case, which is another limitation) and second thing there is another probing technique called quadratic probing. Oops, I just saw at the very end of video, where you already said about it that will discuss in next video. (Sorry my forwarding mistakes at the end :D )