Start Here: Bloom Filters

Why do you need to know this 1970 Data Structure for your next System Design Interview?

Photo by Ilya Pavlov on Unsplash

Let’s get the definition out of the way first: “A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set.” Let’s unravel it a bit.