What is a Bloom filter?

What is a Bloom filter?

Approach: Describe space-efficient probabilistic data structure.

A space-efficient probabilistic data structure used to test whether an element is a member of a set. It can yield false positives but never false negatives.

Follow-up: When would you use a Bloom filter?

Key concepts: false positives, hashing, membership test.