The O(n) Club: Alien Dictionary: Sorting Out Topo-Sorted Antics
The O(n) Club: Alien Dictionary – Sorting Out Topo-Sorted Antics ⚡ TL;DR The aliens dumped a list of words in your inbox and expect you to…
The O(n) Club: Palindrome Pairs — Hashmaps, Not Hunches
The O(n) Club: Palindrome Pairs — Hashmaps, Not Hunches ⚡ TL;DR Find every unique pair of indices (i, j) in an array of words where words[i] +…
The O(n) Club: Combination Sum III, or: Picking K Numbers that Add Up, But Skip the Guilt
The O(n) Club: Combination Sum III, or: Picking K Numbers that Add Up, But Skip the Guilt ⚡ TL;DR Find every possible set of k unique numbers…
The O(n) Club: Serialize and Deserialize BST—Now With 50% Less Useless Data
The O(n) Club: Serialize and Deserialize BST—Now With 50% Less Useless Data ⚡ TL;DR Want to flatten a Binary Search Tree for storage or…
The O(n) Club: Open the Lock (LeetCode 752) — When BFS Is Literally All You Need
The O(n) Club: Open the Lock (LeetCode 752) — When BFS Is Literally All You Need ⚡ TL;DR You’ve got a 4-wheel lock (think: digital nightmare),…
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: Number of Matching Subsequences: Parading Your Words With Buckets, Not Regret
The O(n) Club: Number of Matching Subsequences — Parading Your Words With Buckets, Not Regret ⚡ TL;DR You get a string s and an array of…
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: 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: 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…