Bloom filters are an essential class of probabilistic data structures designed for rapid set membership testing while minimising memory usage. By utilising multiple hash functions, these structures ...

Let's say I have no more than a few hundred UUIDs, the set of which will only be updated rarely. Let's furthermore say I want to, at runtime, check if an arbitrary UUID belongs to said predefined set.

I see it time and again in Google interviews or new-grad hires: The way data structures and algorithms — among the most important subjects in a proper computer science curriculum — are learnt is often ...