Blog

Your dream job? Lets Git IT.
Interactive technical interview preparation platform designed for modern developers.

XGitHub

Platform

  • Categories

Resources

  • Blog
  • About the app
  • FAQ
  • Feedback

Legal

  • Privacy Policy
  • Terms of Service

© 2025 LetsGit.IT. All rights reserved.

LetsGit.IT/Categories/Data Structures
Data Structureshard

What is a Bloom filter and what trade-off does it make?

Tags
#bloom-filter#probabilistic#hashing#memory
Back to categoryPractice quiz

Answer

A Bloom filter is a probabilistic set for membership tests. It can return false positives (might say “present” when it’s not), but it never returns false negatives. It’s very memory efficient and fast, but you can’t retrieve the original items.

Related questions

Data Structures
Sparse matrix representation: when would you use CSR/COO instead of a dense array?
#sparse-matrix#csr#coo
Data Structures
Cuckoo hashing: what is it and what trade-off does it make?
#hashing#cuckoo-hashing#hash-table
Data Structures
Bitset/bitmap: what is it and when is it a good choice?
#bitset#bitmap#memory
Data Structures
What is a skip list and how does it compare to balanced trees?
#skip-list#linked-list#probabilistic
Data Structures
How does a HashMap work internally?
#hashmap#hashing#collision
Java
Generational garbage collection: why does the JVM split memory into young/old?
#java#gc#jvm