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: 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: 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: 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: 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…
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: Flatten a Multilevel Doubly Linked List — Now with 100% Less NullPointerException
The O(n) Club: Flatten a Multilevel Doubly Linked List — Now with 100% Less NullPointerException ⚡ TL;DR Take your multi-level doubly linked…
The O(n) Club: Contains Duplicate: The HashSet Supremacy Edition
The O(n) Club: Contains Duplicate—The HashSet Supremacy Edition ⚡ TL;DR Want to bully an array into confessing its duplicates? Toss everything…
The O(n) Club: Subarray Product Less Than K (Why Sliding Windows Aren’t Just For Sums)
The O(n) Club: Subarray Product Less Than K (Why Sliding Windows Aren’t Just For Sums) ⚡ TL;DR Given an array of positive ints (nums)…
The O(n) Club: Word Ladder II – BFS, DFS, and the Great Shortest-Path Scavenger Hunt
The O(n) Club: Word Ladder II – BFS, DFS, and the Great Shortest-Path Scavenger Hunt ⚡ TL;DR You need to find all the shortest word ladders…