Bloom filter tells:
- item is definitely NOT present
- or MAYBE present

## Why useful
- huge datasets
- save memory

## Graph
```mermaid
flowchart LR
  A[Item] --> B[Hash1]
  A --> C[Hash2]
  B --> D[Bit array]
  C --> D
```

## Remember
- no false negatives
- possible false positives
- used in databases and caches


Understand bloom filters for memory-efficient membership checks with possible false positives.

Bloom Filter Concept

Master fundamental data structures and their implementations.

Bloom Filter Concept

Why useful

Graph

Remember

More on Data Structures

Data Structures Intro

Big O Basics

List Fundamentals