The O(n) Club: Non-overlapping Intervals — Uninvite Guests, Save the Buffet
The O(n) Club: Non-overlapping Intervals — Uninvite Guests, Save the Buffet ⚡ TL;DR Got a stack of intervals and need to make sure none of…
The O(n) Club: Flood Fill (LeetCode 733): When Your Paint Bucket Actually Needs a Manual
The O(n) Club: Flood Fill (LeetCode 733): When Your Paint Bucket Actually Needs a Manual ⚡ TL;DR You want the code version of MS Paint’s…
The O(n) Club: Redundant Connection — Java’s Answer to Annoying Cycles
The O(n) Club: Redundant Connection — Java’s Answer to Annoying Cycles ⚡ TL;DR Some smart aleck added an extra edge to your tree, turning it…
The O(n) Club: Jewels and Stones — HashSet Heroics for the Chronically Loopy
The O(n) Club: Jewels and Stones — HashSet Heroics for the Chronically Loopy ⚡ TL;DR You have a string of jewels (unique, case-sensitive,…
The O(n) Club: Critical Connections in a Network: The Java Tarjan, Unplugged
The O(n) Club: Critical Connections in a Network — The Java Tarjan, Unplugged ⚡ TL;DR Finding bridges (aka critical cables) in a network:…
The O(n) Club: Stack Your Sanity with LeetCode 224’s Basic Calculator
The O(n) Club: Stack Your Sanity with LeetCode 224’s Basic Calculator ⚡ TL;DR Can you evaluate arithmetic strings with ‘+’,…
The O(n) Club: Minimum Remove to Make Valid Parentheses — Java’s Answer to Your Bracket Nightmares
The O(n) Club: Minimum Remove to Make Valid Parentheses — Java’s Answer to Your Bracket Nightmares ⚡ TL;DR Dev nightmare: You have a string…
The O(n) Club: Distribute Coins in Binary Tree — The DFS Therapy Session
The O(n) Club: Distribute Coins in Binary Tree — The DFS Therapy Session ⚡ TL;DR Binary tree out of coin balance? Every node needs exactly one…
The O(n) Club: Populating Next Right Pointers in Each Node II: Now With 100% More Pointer-Juggling
The O(n) Club: Populating Next Right Pointers in Each Node II — Now With 100% More Pointer-Juggling ⚡ TL;DR Given a binary tree where some…
The O(n) Club: Maximum Binary Tree: When Your Array Is a Bunch of Control Freaks
The O(n) Club: Maximum Binary Tree—When Your Array Is a Bunch of Control Freaks ⚡ TL;DR Choice: scan for the max, crown it root, recursively…