Explore >> Select a destination
|
You are here 
|
www.adamconrad.dev | ||
| | | | |
emre.me
|
|
| | | | | A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing associative arrays1 (maps, dictionaries). | |
| | | | |
my-it-notes.com
|
|
| | | | | Few observations in regards to hash usage, in projects where data volume and spikes in load shift engineering from the KISS paradigm to the extent where you have to really care about underlying technologies and data structures. There are different hash functions tailored for different use cases - quick pattern matching in Rabin-Karp algorithm, prefix ... | |
| | | | |
lukesingham.com
|
|
| | | | | Grokking Algorithms is a beautifully formatted book that explains complex material simply using pictures, analogies and high level practical explanations. This post is a review and summary of the Grokking Algorithms book. | |
| | | | |
cprimozic.net
|
|
| | | A detailed summary of the techniques I used to optimize my Advent of Code 2024 solution for Day 9 Part 2. Employs a variety of techniques including algorithmic shortcuts, bespoke data structures, and low-level optimizations + SIMD. | ||
