© 2026 LinearBytes Inc.
Search posts, tags, users, and pages
Abstract Algorithms
Exploring the fascinating world of algorithms, data structures, and software engineering through clear explanations and practical examples.
TLDR TLDR: A Bloom Filter is a bit array + multiple hash functions that answers "Is X in the set?" in $O(1)$ constant space. It can return false positives (say "yes" when the answer is "no") but never false negatives (never says "no" when the answer...
No responses yet.