Sparround

Hash-based structures

0%

How a hash table works inside, how collisions are resolved, choosing between Set and Map correctly, and the interview patterns that turn O(n²) solutions into O(n) with hashing.