Hash Map - Data Structures in Python #4

[@VaibhavSingh_code]

Love from Indian coders and thanks sir for this series

[@NeuralNine]

❤️

[@piotrmazgaj]

This is my seal. I have watched the entire video, understood it, and I can explain it in my own words, thus I have gained knowledge. This is my seal.

[@igorrogi4368]

Can you explain why you hardcoderd 31 in line: hash_result = (hash_result * 31 * ord(c)) % self.capacity? Thanks.

[@lenkaleskova9006]

Please explain Luhn algorithm. Some count reverse, some not. I'm confused. You explain everything very well, detailed and you have pleasant voice and nice accent.

[@krishnakant8687]

Hey mate! Thank you for such awesome vidoes! Are you also going to cover algorithms in this series ?

[@NeuralNine]

Not in this one but maybe I can do an additional tutorial series if this one does well.

[@piotrmazgaj]

Please have mercy! I haven't done the Queue yet ; p

[@NeuralNine]

Motivation to keep up the speed :)

[@taufiqurrahmansagafkelrey2833]

LESSSGOOOO!!🎉🎉🎉

[@NeuralNine]

🥳

[@agamergen]

Two videos are hidden. Will they be unhidden?

[@NeuralNine]

Yes of course! They are scheduled to be released already! :)

[@halim7725]

Thanks a lot

[@NeuralNine]

Hope it helps!

[@Hamsters_Rage]

again you missed interesting part - case when keys are different but its hashes are equal

[@piotrmazgaj]

No.... It works just find. In that case each bucket turns into a sub-list with multiple elements. Try your self with some ridiculously small number as capacity (e.g. 4 or 8) and overflow it with key, value pairs.

[@Hamsters_Rage]

@@piotrmazgaj yes, my bad. missed it