May 10 · 11 min read · Graphs are the most feared topic in coding interviews — not because they're impossible, but because most people learn the algorithms in isolation without understanding when to use each one. This guide
Join discussion
May 8 · 2 min read · If you’ve ever swapped between Java’s built-in String.split and Apache Commons’ StringUtils.split, you might have been surprised by a missing empty token at the start of the result. They differ in how
Join discussionMay 4 · 7 min read · In 2026, analytics is no longer just about reporting what happened—it’s about enabling immediate, confident decisions. For business leaders, the value of analytics lies in speed, clarity, and actionab
Join discussionMay 3 · 17 min read · TLDR: HyperLogLog estimates the number of distinct elements in a dataset using ~12 KB of memory regardless of cardinality — with ±0.81% error. The insight: if you hash every element to a random bit string, the maximum length of leading zeros you obse...
Join discussionMay 2 · 14 min read · Every developer writes code. But not every developer understands why their code slows to a crawl on large inputs — or why their interviewer winces at a nested loop. Big-O notation is the language that
LNLaura and 2 more commented
May 3 · 21 min read · TLDR: Count-Min Sketch (CMS) is a fixed-size d × w counter matrix that estimates how often any element has appeared in a stream. Insert: hash the element with each of the d hash functions to get one column per row, increment those d counters. Query: ...
Join discussion
