The O(n) Club: All Possible Full Binary Trees — Recursion Without Regrets
The O(n) Club: All Possible Full Binary Trees — Recursion Without Regrets ⚡ TL;DR Want every structurally unique full binary tree for an odd…
The O(n) Club: Sum of Distances in Tree — Two DFSes, No Tears
The O(n) Club: Sum of Distances in Tree — Two DFSes, No Tears ⚡ TL;DR Want to sum distances from every node to every other node? Don’t…
The O(n) Club: Binary Tree Cameras: Minimum Coverage, Maximum Laziness
The O(n) Club: Binary Tree Cameras—Minimum Coverage, Maximum Laziness ⚡ TL;DR How many cameras do you need to keep an eye on every spot in…
The O(n) Club: Minimum Cost Tree From Leaf Values — Monotonic Stack Style
The O(n) Club: Minimum Cost Tree From Leaf Values — Monotonic Stack Style ⚡ TL;DR Your goal: take an array of integers (leaves) and build a…
The O(n) Club: Minimum Cost Tree From Leaf Values — Monotonic Stack Style
The O(n) Club: Minimum Cost Tree From Leaf Values — Monotonic Stack Style ⚡ TL;DR Your goal: take an array of integers (leaves) and build a…
The O(n) Club: Minimum Cost Tree From Leaf Values — Monotonic Stack Style
The O(n) Club: Minimum Cost Tree From Leaf Values — Monotonic Stack Style ⚡ TL;DR Your goal: take an array of integers (leaves) and build a…
The O(n) Club: Cheapest Flights Within K Stops: Layovers, Logic, and Code Turbulence
The O(n) Club: Cheapest Flights Within K Stops – Layovers, Logic, and Code Turbulence ⚡ TL;DR Want the cheapest ticket from A to B with no…
The O(n) Club: Unique Binary Search Trees II: Recursion’s Party Trick
The O(n) Club: Unique Binary Search Trees II — Recursion’s Party Trick ⚡ TL;DR Given n, build every possible BST using values 1 to n. Don’t…
The O(n) Club: Longest Increasing Path in a Matrix — Because Who Needs Diagonals?
The O(n) Club: Longest Increasing Path in a Matrix — Because Who Needs Diagonals? ⚡ TL;DR Find the longest path in a matrix by moving up,…
The O(n) Club: Counting Bits: Why Loop When You Can Cheat?
The O(n) Club: Counting Bits: Why Loop When You Can Cheat? ⚡ TL;DR Given n, return an array of the number of 1’s (set bits) in each…