If you had to implement a hash map yourself, how would you build it?
Hash the key into a bucket index, handle collisions with chaining or open addressing, and resize once the load factor is exceeded. Swift's Dictionary uses open addressing (linear probing) and seeded SipHash.
SwiftMultiple choiceIntro
You have tens of thousands of user IDs and need to check repeatedly whether a given ID is…
#dictionary #hashable
CS fundamentals and algorithmsMultiple choiceBasics
What problem does this type cause when you put it in a Set? …
#hashable
CS fundamentals and algorithmsShort answerAdvanced
You need to write an in-memory image cache with LRU eviction yourself. Which data…
#dictionary
CS fundamentals and algorithmsShort answerExpert
When you apply a new snapshot to UICollectionViewDiffableDataSource, how does it compute…
#hashable