Join 📚 Kevin's Highlights
A batch of the best highlights from what Kevin's read, .
“I’m sick of writing everything in numbered order,” Tom said, listlessly
For Many Years I’ve Been Collecting Tom Swifties and Croakers...
Adam Sharp
If you’re mathematically inclined,
then you could use the [pigeonhole principle](https://en.wikipedia.org/wiki/Pigeonhole_principle)
to describe hash collisions more formally:
> Given *m* items and *n* containers,
> if *m* > *n*,
> then there’s at least one container
> with more than one item.
In this context,
items are a potentially infinite number of values
that you feed into the hash function,
while containers are their hash values
assigned from a finite pool.
Build a Hash Table in Python With TDD
Bartosz Zaczyński
[Q3] ONCE SOLD BY THE GIRL SCOUTS UNDER THE NAME “SAVANNAH SMILES,” **THIS LEMON COOKIE** PICTURED ABOVE SOUNDS LIKE IT’S MORE REFRESHING THAN OTHERS
ZINGER
Correct answers
COOLER
Unnamed Document
Google Docs
...catch up on these, and many more highlights
Readwise