Bloom Filter
A Bloom filter is a space-efficient probabilistic set-membership structure. It can say 'definitely not present' or 'possibly present', so false positives are possible but false negatives are not in the standard design.
Start with this mental model
A Bloom filter is a space-efficient probabilistic set-membership structure. It can say 'definitely not present' or 'possibly present', so false positives are possible but false negatives are not in the standard design.
How it works, without unnecessary jargon
Hash an item with several hash functions and set several bits.
A lookup checks the same bit positions. Any zero means definitely absent; all ones means maybe present.
Read the algorithm as a sequence of decisions
Identify the invariant that must always remain true.
Follow the read/update path through the structure.
After a mutation, restore the invariant before returning.
Read a tiny input by hand and write down the state after every important operation. For Bloom Filter, the goal is to make the invariant visible rather than to memorize code.
Varies by implementation / input constraints
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
Good fit
- Choose it when its dominant operations match your workload.
- Compare memory overhead as well as Big-O.
What usually goes wrong
- Memorizing complexity without understanding representation.
- Ignoring worst-case shape or resizing/rebalancing costs.
A professional answer shape
State the trade-off explicitly: excellent memory efficiency and fast checks in exchange for false positives and difficult deletion in the basic structure.
What problem does Bloom Filter solve?
A Bloom filter is a space-efficient probabilistic set-membership structure. It can say 'definitely not present' or 'possibly present', so false positives are possible but false negatives are not in the standard design.
What should I mention about complexity?
Its typical cost here is Varies by implementation / input constraints, but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
What is the most common mistake?
Memorizing complexity without understanding representation.