The O(n) Club: Rotting Oranges – How Fast Can You Spoil Lunch?
The O(n) Club: Rotting Oranges – How Fast Can You Spoil Lunch? ⚡ TL;DR Staring at a grid of oranges where some are gross (rotten) and some are…
The O(n) Club: Maximum Depth of Binary Tree: Because Shallow Isn’t Cool
The O(n) Club: Maximum Depth of Binary Tree — Because Shallow Isn’t Cool ⚡ TL;DR Measure how far you can plummet from root to leaf in a binary…
The O(n) Club: Palindromic Substrings: The Hunt That Expands Out (Not Downward Spiral)
The O(n) Club: Palindromic Substrings: The Hunt That Expands Out (Not Downward Spiral) ⚡ TL;DR Counting all contiguous palindromic substrings?…
The O(n) Club: Binary Tree Right Side View: Why Only ‘Right’ Isn’t Always Right
The O(n) Club: Binary Tree Right Side View—Why Only ‘Right’ Isn’t Always Right ⚡ TL;DR Fight your right-bias: the goal is to return every…
The O(n) Club: Find All Anagrams in a String: Java-Only, No Permutation Panic
The O(n) Club: Find All Anagrams in a String: Java-Only, No Permutation Panic ⚡ TL;DR You get a pattern. You get a string. Find every place…
The O(n) Club: Sort List—Where Linked Lists and Merge Sort Go Full Buddy Cop
The O(n) Club: Sort List—Where Linked Lists and Merge Sort Go Full Buddy Cop ⚡ TL;DR LeetCode 148 wants you to sort a singly linked list.…
The O(n) Club: House Robber III: Binary Trees, Burglaries & Existential Dread
The O(n) Club: House Robber III—Binary Trees, Burglaries & Existential Dread ⚡ TL;DR You’re breaking into a mansion that’s…
The O(n) Club: Linked List Cycle II — Get Over Yourself and Find the Actual Cycle Start
The O(n) Club: Linked List Cycle II — Get Over Yourself and Find the Actual Cycle Start ⚡ TL;DR You’re over here detecting cycles like it’s a…
The O(n) Club: Make Your Trees Portable—The Surprisingly Deadly World of Binary Tree Serialization
The O(n) Club: Make Your Trees Portable—The Surprisingly Deadly World of Binary Tree Serialization ⚡ TL;DR Serializing a binary tree means…
The O(n) Club: Merge Two Binary Trees: Where Recursion Meets the Forest for the Trees
The O(n) Club: Merge Two Binary Trees—Where Recursion Meets the Forest for the Trees ⚡ TL;DR Boss says, “Take two binary trees, smoosh…