The O(n) Club: Koko Eating Bananas — Why Monkeys Ace Coding Interviews
The O(n) Club: Koko Eating Bananas — Why Monkeys Ace Coding Interviews ⚡ TL;DR Banana-eating is serious work, apparently. Koko wants to finish…
The O(n) Club: Candy: Because Satisfying Kids—and Your Interviewer—Takes Two Passes
The O(n) Club: Candy: Because Satisfying Kids—and Your Interviewer—Takes Two Passes ⚡ TL;DR LeetCode 135, aka the “Why kids riot over…
The O(n) Club: Remove Duplicates from Sorted Array II—Twice Is Nice, Thrice Is Jail
The O(n) Club: Remove Duplicates from Sorted Array II—Twice Is Nice, Thrice Is Jail ⚡ TL;DR Your sorted array needs some tough love: keep each…
The O(n) Club: Range Sum Query – Mutable (Or Why Prefix Sums Need Therapy)
The O(n) Club: Range Sum Query – Mutable (Or Why Prefix Sums Need Therapy) ⚡ TL;DR If you want fast range sums and in-place updates,…
The O(n) Club: Vertical Order Traversal of a Binary Tree: Columns, Chaos, and Why BFS Wins
The O(n) Club: Vertical Order Traversal of a Binary Tree — Columns, Chaos, and Why BFS Wins ⚡ TL;DR Want to print a binary tree column by…
The O(n) Club: Ones and Zeroes: Binary Knapsack and the Joy of Resource Regret
The O(n) Club: Ones and Zeroes — Binary Knapsack and the Joy of Resource Regret ⚡ TL;DR Your mission: select the most binary strings possible…
The O(n) Club: Unique Paths III and the Roomba That Never Misses a Spot
The O(n) Club: Unique Paths III and the Roomba That Never Misses a Spot ⚡ TL;DR Pathfinding? Easy. Pathfinding without leaving a single square…
The O(n) Club: Word Pattern—Where One-to-One Mapping Gets Real (and Painful)
The O(n) Club: Word Pattern—Where One-to-One Mapping Gets Real (and Painful) ⚡ TL;DR Given a pattern like “abba” and a string like…
The O(n) Club: Arithmetic Slices: Why Your Loops Are Weeping (And How to Fix Them)
The O(n) Club: Arithmetic Slices — Why Your Loops Are Weeping (And How to Fix Them) ⚡ TL;DR Count all contiguous subarrays (length 3+) where…
The O(n) Club: The Shortest Subarray with Sum at Least K (When Negatives Sabotage Everything)
The O(n) Club: The Shortest Subarray with Sum at Least K (When Negatives Sabotage Everything)