Join 📚 Kevin's Highlights
A batch of the best highlights from what Kevin's read, .
The Meditations Newsletter #017
Alex from Sunsama
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
*Does my weekly review...*
• *...include space to declutter physically, digitally, and mentally?*
• *...provide an accurate assessment of the past week?*
• *...let me evaluate progress and get current on my major goals and projects?*
• *... help me plan for the week ahead?*
• *... leave room to cultivate inspiration and spontaneity?*
The Weekly Review
Todoist
...catch up on these, and many more highlights
Readwise