Blog

The XOR and popcount tricks behind Single Number, Missing Number and Counting Bits are small enough to verify exhaustively, so this runs them over every input they claim to cover and reports the exact value at which each one stops being correct.

The stack loop that evaluates an RPN expression is fifteen lines, but it returns undefined for an empty array, NaN for a missing operand and -0 for a negative fraction, so the real work is deciding what your evaluator owes a caller who hands it nonsense.

Union Find trades every graph question except one for speed, and measured tree heights show exactly what path compression and union by rank each buy you — with tested solutions to Redundant Connection, Number of Connected Components, and Accounts Merge.

A monotonic stack maintains elements in order and pops when that order breaks — finding the next greater element for every popped value in O(n) total.

The Two Sum problem is the "Hello World" of hash map problems. Most people solve it, move on, and treat it as a warmup. That's a mistake. The pattern behind Two Sum — trading space for lookup speed — shows up in dozens of harder problems.

Your Node.js server calls res.send("hello") and somewhere, 1400 bytes cross the planet in 80 milliseconds and appear correctly in a browser. That's wild. But what actually happens?

Two mid-to-senior linked list problems that test data structure design: deep-copying a list with random pointers (O(1) space trick), and implementing LRU Cache in O(1).

Sliding window maximum is the classic follow-up to every sliding window problem. Learn the monotone deque pattern in JavaScript with LeetCode 239, 1438, and 1696.

LC 297 is a Hard but the insight is simple: null markers make any traversal unambiguous. Learn preorder DFS and BFS serialization, plus the BST shortcut for LC 449.