Probabilistic Structures

Answer membership, frequency and count-distinct questions over huge streams in kilobytes.

4 challenges · ~3 h

1. 1Build a Bloom FilterFreek hashes over a bit arrayIntermediate~50 minNot started
2. 2Build a Cuckoo Filterfingerprints with cuckoo kickingAdvanced~50 minNot started
3. 3Build a Count-Min Sketchmin across hashed counter rowsIntermediate~45 minNot started
4. 4Build a HyperLogLogleading-zero ranks per registerAdvanced~60 minNot started