Join 📚 Kevin's Highlights

A batch of the best highlights from what Kevin's read, .

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

![](https://media.licdn.com/dms/image/D4D22AQFgTrM2AXmyjQ/feedshare-shrink_800/0/1694371183156?e=1697068800&v=beta&t=Xl-ji1iMOsvzfapy8NRZ5kD1JYAsPrNxacIreRD7nDs) [Link](https://media.licdn.com/dms/image/D4D22AQFgTrM2AXmyjQ/feedshare-shrink_800/0/1694371183156?e=1697068800&v=beta&t=Xl-ji1iMOsvzfapy8NRZ5kD1JYAsPrNxacIreRD7nDs)

How Indexes Make Your Queries Fast

Julia Evans

Software companies aren't made of code, much like bakeries aren't made of bread. Software companies are made of *processes that produce and maintain code*. Software is a by-product of these processes. It's not even the *final* product — it's a means to an end. The final product is a solution to a business problem.

The Machine That Makes the Thing Is More Valuable Than the Thing

François Chollet

...catch up on these, and many more highlights