Join 📚 Kevin's Highlights
A batch of the best highlights from what Kevin's read, .
You don’t have to know how to code to participate, though! There are many different ways to participate, including:
• Writing a blog post or social media post highlighting an open source project that you find interesting
• Exploring documentation
• Triaging issues
• Writing issues
• Attending an event that focuses on open source
• Exploring open source projects to contribute to
How to Join the #100daysofOSS Challenge and Embrace the Power of Open Source
BekahHW
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
In-Search-of-Security
Swirling Visions
...catch up on these, and many more highlights
Readwise