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: 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)
The O(n) Club: Find Minimum in Rotated Sorted Array II: The Binary Search Headache That Won’t Quit
The O(n) Club: Find Minimum in Rotated Sorted Array II – The Binary Search Headache That Won’t Quit ⚡ TL;DR Got a sorted array, spun…
The O(n) Club: Maximum Sum Circular Subarray Madness
The O(n) Club: Maximum Sum Circular Subarray Madness ⚡ TL;DR If you’ve ever dreamed of wrapping your arrays like burritos, here’s…
The O(n) Club: Conquer Subarrays with Exactly K Distinct Integers (Before Coffee Runs Out)
The O(n) Club: Conquer Subarrays with Exactly K Distinct Integers (Before Coffee Runs Out) ⚡ TL;DR Counting subarrays with exactly K distinct…
The O(n) Club: Predict the Winner’s Game—Why Dynamic Programming Always Wins (and Greedy Moves Cry in the Corner)
The O(n) Club: Predict the Winner’s Game—Why Dynamic Programming Always Wins (and Greedy Moves Cry in the Corner) ⚡ TL;DR It’s two coders, one…
The O(n) Club: Smaller Numbers Than You (and Other Ego Checks)
The O(n) Club: Smaller Numbers Than You (and Other Ego Checks) ⚡ TL;DR Need to count how many numbers are strictly smaller than each item in…
The O(n) Club: How Pivot Index Became the Therapist Arrays Never Knew They Needed
The O(n) Club: How Pivot Index Became the Therapist Arrays Never Knew They Needed
The O(n) Club: 4Sum II — When Hashmaps Save You from Loop Purgatory
The O(n) Club: 4Sum II — When Hashmaps Save You from Loop Purgatory ⚡ TL;DR Given four integer arrays, count (i, j, k, l) such that nums1[i] +…