The O(n) Club2 Min Read dgtalbugonJuly 6, 2025 The O(n) Club: Remove All Adjacent Duplicates in String II—Stack Attack Edition The O(n) Club: Remove All Adjacent Duplicates in String II—Stack Attack Edition ⚡ TL;DR Input: string + integer k. Goal: keep destroying any… Discover More
The O(n) Club2 Min Read dgtalbugonJuly 5, 2025 The O(n) Club: Two City Scheduling: Greed, Sorting, and Not Getting Yelled At By Accounting The O(n) Club: Two City Scheduling—Greed, Sorting, and Not Getting Yelled At By Accounting ⚡ TL;DR Got an even number of people and two… Discover More
The O(n) Club3 Min Read dgtalbugonJuly 5, 2025 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… Discover More
The O(n) Club3 Min Read dgtalbugonJuly 4, 2025 The O(n) Club: Reverse Pairs & That Merge Sort Plot Twist The O(n) Club: Reverse Pairs & That Merge Sort Plot Twist ⚡ TL;DR LeetCode 493 asks: How many index pairs (i, j) have i 2 * nums[j]?Brute… Discover More
The O(n) Club2 Min Read dgtalbugonJuly 4, 2025 The O(n) Club: Excel Sheet Column Title — The “A-Z” That Breaks Brains The O(n) Club: Excel Sheet Column Title — The “A-Z” That Breaks Brains ⚡ TL;DR Turn a number into Excel’s loopy column… Discover More
The O(n) Club1 Min Read dgtalbugonJuly 3, 2025 The O(n) Club: Expression Add Operators—The Recursion-Induced Headache Edition The O(n) Club: Expression Add Operators—The Recursion-Induced Headache Edition ⚡ TL;DR Take a string of digits. Insert ‘+’,… Discover More
The O(n) Club3 Min Read dgtalbugonJuly 3, 2025 The O(n) Club: Maximum Product of Three Numbers: Beware the Negative Numbers Plot Twist The O(n) Club: Maximum Product of Three Numbers — Beware the Negative Numbers Plot Twist ⚡ TL;DR Want the biggest product from any three… Discover More
The O(n) Club2 Min Read dgtalbugonJuly 2, 2025 The O(n) Club: Insert into a Binary Search Tree – Now With 90% Less Existential Dread The O(n) Club: Insert into a Binary Search Tree – Now With 90% Less Existential Dread ⚡ TL;DR Wanna add a value to a BST without unleashing… Discover More
The O(n) Club2 Min Read dgtalbugonJuly 2, 2025 The O(n) Club: How Many 1’s? Hamming Weight and Your Bitwise Showdown The O(n) Club: How Many 1’s? Hamming Weight and Your Bitwise Showdown ⚡ TL;DR You want to count the number of 1 bits in an integer. You could… Discover More
The O(n) Club2 Min Read dgtalbugonJuly 1, 2025 The O(n) Club: Jump Game III – Exactly, Unforgivingly, To Zero (Or Die Trying) The O(n) Club: Jump Game III – Exactly, Unforgivingly, To Zero (Or Die Trying) ⚡ TL;DR You’re stuck in an array where each index is a dramatic… Discover More