The O(n) Club2 Min Read dgtalbugonJune 10, 2025 The O(n) Club: Integer to Roman – How to Greedily Conquer Antiquity with Java The O(n) Club: Integer to Roman – How to Greedily Conquer Antiquity with Java ⚡ TL;DR Need to translate boring numbers into Roman numerals for… Discover More
The O(n) Club2 Min Read dgtalbugonJune 10, 2025 The O(n) Club: Smaller Numbers Than You (and Other Ego Checks) The O(n) Club: Smaller Numbers Than You (and Other Ego Checks) ⚡ TL;DR Need to count how many numbers are strictly smaller than each item in… Discover More
The O(n) Club2 Min Read dgtalbugonJune 9, 2025 The O(n) Club: How Pivot Index Became the Therapist Arrays Never Knew They Needed The O(n) Club: How Pivot Index Became the Therapist Arrays Never Knew They Needed Discover More
The O(n) Club2 Min Read dgtalbugonJune 9, 2025 The O(n) Club: Average of Levels in a Binary Tree (Or Why Java Hates Decimals) The O(n) Club: Average of Levels in a Binary Tree (Or Why Java Hates Decimals) ⚡ TL;DR For each level of your binary tree, don’t… Discover More
The O(n) Club2 Min Read dgtalbugonJune 8, 2025 The O(n) Club: 4Sum II — When Hashmaps Save You from Loop Purgatory The O(n) Club: 4Sum II — When Hashmaps Save You from Loop Purgatory ⚡ TL;DR Given four integer arrays, count (i, j, k, l) such that nums1[i] +… Discover More
The O(n) Club2 Min Read dgtalbugonJune 8, 2025 The O(n) Club: Reverse Words in a String – Where Your Spaces Go to Sabotage You The O(n) Club: Reverse Words in a String – Where Your Spaces Go to Sabotage You ⚡ TL;DR Given a messy string like ” Hello World from… Discover More
The O(n) Club2 Min Read dgtalbugonJune 7, 2025 The O(n) Club: Remove All Adjacent Duplicates in String — Now With 100% Less Regret Than Brute Force The O(n) Club: Remove All Adjacent Duplicates in String — Now With 100% Less Regret Than Brute Force ⚡ TL;DR Stuck deleting every pair of… Discover More
The O(n) Club2 Min Read dgtalbugonJune 7, 2025 The O(n) Club: Merge Sorted Arrays — Why Going Backwards Is Forwards Thinking The O(n) Club: Merge Sorted Arrays — Why Going Backwards Is Forwards Thinking ⚡ TL;DR Trying to merge two already sorted arrays (LeetCode 88)… Discover More
The O(n) Club2 Min Read dgtalbugonJune 6, 2025 The O(n) Club: Find K Pairs with Smallest Sums — Now with 93% Less Suffering The O(n) Club: Find K Pairs with Smallest Sums — Now with 93% Less Suffering ⚡ TL;DR Find k pairs with the smallest sums by using a… Discover More
The O(n) Club2 Min Read dgtalbugonJune 6, 2025 The O(n) Club: Find the Town Judge (LeetCode 997) — Java Edition for Trust Issues The O(n) Club: Find the Town Judge (LeetCode 997) — Java Edition for Trust Issues ⚡ TL;DR This problem is about sniffing out that one person… Discover More