hashing

A grounded systems-coding screen: locate files with identical content across a tree. The naive all-pairs hash wastes work. The signal is the size prefilter plus a cheap-hash gate ahead of the full hash. Here is the layered approach.

Rabin-Karp slides a fixed-width hash across the text so each window costs O(1) to update, which makes it ideal for matching many patterns at once. The signal is the polynomial rolling hash, modular arithmetic, and why you still verify on a hash hit. Here is the answer.

A deceptively rich warm-up. The interesting calls are how you mint short, collision-free, unguessable keys at scale, and how a read-heavy 100:1 workload shapes storage and caching. Here is the clean design with capacity math.