The O(n) Club2 Min Read dgtalbugonJuly 8, 2025 The O(n) Club: Longest Palindrome – How to Build One Without Breaking a Sweat The O(n) Club: Longest Palindrome – How to Build One Without Breaking a Sweat ⚡ TL;DR This isn’t “is it a palindrome?” country —… Discover More
The O(n) Club2 Min Read dgtalbugonJuly 8, 2025 The O(n) Club: Validate Stack Sequences: Because Stack Cheating Isn’t a Sport The O(n) Club: Validate Stack Sequences — Because Stack Cheating Isn’t a Sport ⚡ TL;DR Given two lists—one is the push parade, the other is… Discover More
The O(n) Club2 Min Read dgtalbugonJuly 7, 2025 The O(n) Club: Intersection of Two Arrays: When HashSets Save Your Sanity (and Your CPU) The O(n) Club: Intersection of Two Arrays — When HashSets Save Your Sanity (and Your CPU) ⚡ TL;DR You want all unique elements from both… Discover More
The O(n) Club1 Min Read dgtalbugonJuly 7, 2025 The O(n) Club: When Prime Factors Make You a Copy-Paste Ninja (2 Keys Keyboard) The O(n) Club: When Prime Factors Make You a Copy-Paste Ninja (2 Keys Keyboard) ⚡ TL;DR You have two buttons and a dream: Copy All and Paste.… Discover More
The O(n) Club3 Min Read dgtalbugonJuly 6, 2025 The O(n) Club: The 2D Prefix Sum – Stop Hating Matrix Math (and Yourself) The O(n) Club: The 2D Prefix Sum – Stop Hating Matrix Math (and Yourself) ⚡ TL;DR Quit writing those nested loops for every sum in a matrix.… Discover More
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