The O(n) Club1 Min Read dgtalbugonFebruary 8, 2025 The O(n) Club: Maximal Square: When DP Plays Tetris With Your Sanity The O(n) Club: Maximal Square—When DP Plays Tetris With Your Sanity ⚡ TL;DR Tired of brute-forcing every square in a 2D matrix of… Discover More
The O(n) Club2 Min Read dgtalbugonFebruary 8, 2025 The O(n) Club: Linked List Cycle Detection, or Why Tortoises Win at Java The O(n) Club: Linked List Cycle Detection, or Why Tortoises Win at Java ⚡ TL;DR Is your linked list accidentally hosting the world’s… Discover More
The O(n) Club1 Min Read dgtalbugonFebruary 7, 2025 The O(n) Club: Unique Binary Search Trees—Or, Why Catalan Numbers Rule the Forest The O(n) Club: Unique Binary Search Trees—Or, Why Catalan Numbers Rule the Forest ⚡ TL;DR Want to know how many different BSTs you can make… Discover More
The O(n) Club3 Min Read dgtalbugonFebruary 7, 2025 The O(n) Club: Word Ladder (LeetCode 127): BFS Wizardry Meets Word Jenga The O(n) Club: Word Ladder (LeetCode 127): BFS Wizardry Meets Word Jenga ⚡ TL;DR Turn beginWord into endWord, one letter per move, using only… Discover More
The O(n) Club3 Min Read dgtalbugonFebruary 6, 2025 The O(n) Club: Inorder Traversal: Sorted Drama in Binary Trees — O(n) Club Style The O(n) Club: Inorder Traversal — Sorted Drama in Binary Trees ⚡ TL;DR Inorder traversal is your “left, root, right” magic trick for binary… Discover More
The O(n) Club2 Min Read dgtalbugonFebruary 6, 2025 The O(n) Club: Partition Equal Subset Sum: Arrays at the Divorce Court The O(n) Club: Partition Equal Subset Sum—Arrays at the Divorce Court ⚡ TL;DR Can you separate an array of positive integers into two squads… Discover More
The O(n) Club1 Min Read dgtalbugonFebruary 5, 2025 The O(n) Club: Jump Game II — Greedy Hops That’ll Save Your Coding Soul The O(n) Club: Jump Game II — Greedy Hops That’ll Save Your Coding Soul Discover More
The O(n) Club2 Min Read dgtalbugonFebruary 5, 2025 The O(n) Club: The Binary Tree Diameter Problem (Now With 100% Less Root Worship) The O(n) Club: The Binary Tree Diameter Problem (Now With 100% Less Root Worship) ⚡ TL;DR For anyone too caffeinated to read: the “diameter”… Discover More
The O(n) Club3 Min Read dgtalbugonFebruary 4, 2025 The O(n) Club: Binary Tree Level Order Traversal — Herding Nodes, BFS Style The O(n) Club: Binary Tree Level Order Traversal — Herding Nodes, BFS Style ⚡ TL;DR Want to print your binary tree one row at a time? (Think:… Discover More
The O(n) Club3 Min Read dgtalbugonFebruary 4, 2025 The O(n) Club: Path Sum III — Binary Tree Treasure Hunt for Grownups The O(n) Club: Path Sum III — Binary Tree Treasure Hunt for Grownups ⚡ TL;DR Count all downward (no climbing back up, sorry monkeys) paths in… Discover More