What is Bloom Filter?
Bloom filters are for set membership which determines whether an element is present in a set or not. Bloom filter is a probabilistic data structure that works on hash-coding methods (similar to HashTable).
It is a memory-efficient, probabilistic data structure that we can use to answer the question of whether or not a given element is in a set.
