Topic LibraryFlat and browsable
Topic Library
10 TOPICS
CANONICAL
Dynamic Programming
Overlapping subproblems made visible.
AvailableO(n*W)
CANONICAL
Dijkstra's Shortest Path
Weighted shortest paths via a priority-queue frontier.
AvailableO(E + V log V)
CANONICAL
Union-Find
Near constant-time connectivity with path compression.
AvailableO(alpha(n))
CANONICAL
Backtracking
Systematic search and pruning over the recursion tree.
AvailableO(N!)
CANONICAL
Tries
Prefix trees behind autocomplete.
AvailableO(L)
SYSTEMS
Bloom Filters
Probabilistic membership: definitely no, maybe yes.
AvailableO(k)
SYSTEMS
Consistent Hashing
How distributed caches and shards avoid reshuffling.
AvailableO(log n)
SYSTEMS
LRU Cache
The eviction policy you configured but never saw.
AvailableO(1)
SYSTEMS
B-Trees
The structure under every database index and filesystem.
AvailableO(log n)
SYSTEMS
Rate Limiting
The algorithm gating every API you call.
AvailableO(1)
Total Topics10
Available Now10
Coming Soon0