Skip to content
FollowtheDamnCode

Bloom Filters & Skip Lists

Two probabilistic structures — a tiny set that may say "yes" wrongly, and a sorted list that stays fast by flipping coins.

This topic is part of Pro.

Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.

See what Pro includesDownload the app

What is in it

  1. 1Bloom filtersA bit array and k hash functions that answer "definitely not" or "probably yes" in a handful of bits per item. Pro
  2. 2Skip listsA sorted linked list with express lanes built from coin flips — O(log n) search, insert, and delete without rebalancing. Pro