4d ago · 2 min read · Key-value pairs for lookup Day 136 of 149 👉 Full deep-dive with code examples The Phone Book Analogy Remember phone books? Find "Smith" → Flip directly to S section Look up the name → Get the phone number You don't scan from the beginning! Maps w...
Join discussion5d ago · 2 min read · Collections with no duplicates Day 135 of 149 👉 Full deep-dive with code examples The Guest List Analogy You're making a party guest list: Add "Alice" → Alice is on the list Add "Bob" → Bob is on the list Add "Alice" again → Nothing happens! She's...
Join discussion6d ago · 2 min read · Trees for storing strings efficiently Day 134 of 149 👉 Full deep-dive with code examples The Autocomplete Analogy When you type on your phone: Type "hel" → Suggestions: "hello", "help", "helicopter" Type "help" → Suggestions: "help", "helpful", "h...
Join discussionMay 7 · 2 min read · Each node has at most two children Day 133 of 149 👉 Full deep-dive with code examples The Family Tree Analogy Imagine a family tree where each person can have at most two children. The top person is the root, with branches going down. A binary tree...
Join discussionApr 23 · 4 min read · Shrinking a 250K-word dictionary to 500KB: from tries to DAWGs to succinct bit-packed trees If you are building a word game for the browser, you are fighting a constant battle against the "bundle size tax." When you need to validate moves against a s...
Join discussionApr 15 · 2 min read · The Universal Monograph Schema: Technical Protocols for Interoperability, Metadata Integrity, and Global Discovery within the OAPEN and DOAB Networks Metadata for open-access monographs is scattered,
Join discussion
Mar 27 · 2 min read · Priority queues with fast access to min/max Day 92 of 149 👉 Full deep-dive with code examples The Hospital ER Analogy In an emergency room: Patients aren't treated first-come-first-served Most critical cases get priority The system can keep the mo...
Join discussionMar 26 · 2 min read · Networks of connected nodes Day 91 of 149 👉 Full deep-dive with code examples The Road Map Analogy A road map shows cities connected by roads: Cities = Nodes (vertices) Roads = Edges (connections) Some roads are one-way (directed) Some have distan...
Join discussionMar 18 · 6 min read · TL;DR: Scaling unique view counts for millions of posts requires more than just a COUNT(DISTINCT) query. Modern platforms use HyperLogLog, a probabilistic data structure that estimates cardinality usi
Join discussion
