Probabilistic Data Structures
Everything on SkillVeris tagged Probabilistic Data Structures — collected across the glossary, study notes, blog, and cheat sheets.
4 resources across 1 library
Interview Questions(4)
What is a Count-Min Sketch and When Would You Use One?
A count-min sketch is a probabilistic data structure that estimates the frequency of items in a massive stream using a fixed-size 2D array of counters and seve…
What is a Bloom Filter and When Would You Use One?
A Bloom filter is a space-efficient probabilistic data structure that tells you whether an element is definitely not in a set or possibly in a set, trading a s…
What is a Count-Min Sketch and How Does It Estimate Frequencies?
A Count-Min Sketch is a probabilistic data structure that estimates how many times each item has appeared in a stream using a small, fixed amount of memory, at…
What is HyperLogLog and How Does It Count Distinct Elements?
HyperLogLog is a probabilistic algorithm that estimates the number of distinct elements (cardinality) in a massive dataset using only a few kilobytes of memory…