The O(n) Club: Smallest Range from K Lists: Heapify or Cry in Brute Force
The O(n) Club: Smallest Range from K Lists—Heapify or Cry in Brute Force ⚡ TL;DR If you want the smallest interval covering one number from…
The O(n) Club: Next Greater Node in a Linked List—Stack Sorcery, Java Edition
The O(n) Club: Next Greater Node in a Linked List—Stack Sorcery, Java Edition ⚡ TL;DR Every node in your singly linked list wants to know, “Is…
The O(n) Club: Minimum Swaps To Make Sequences Increasing (or, Why Parallel Universes Matter)
The O(n) Club: Minimum Swaps To Make Sequences Increasing (or, Why Parallel Universes Matter) ⚡ TL;DR You get two number arrays. You want both…
The O(n) Club: Kth Missing Positive Number, or Why Your Integers Keep Vanishing
The O(n) Club: Kth Missing Positive Number, or Why Your Integers Keep Vanishing ⚡ TL;DR If you want the kth missing positive integer from a…
The O(n) Club: Peak Index in a Mountain Array: Because Who Has Time to Climb the Whole Thing?
The O(n) Club: Peak Index in a Mountain Array—Because Who Has Time to Climb the Whole Thing? ⚡ TL;DR You’re staring at an array that goes up,…
The O(n) Club: Shuffle the Array: When ‘Shuffle’ Means Bring a Spreadsheet to a Card Table
The O(n) Club: Shuffle the Array—When ‘Shuffle’ Means Bring a Spreadsheet to a Card Table ⚡ TL;DR LeetCode 1470 calls it…
The O(n) Club: Sliding Window Median: The Interview See-Saw Nobody Warns You About
The O(n) Club: Sliding Window Median—The Interview See-Saw Nobody Warns You About ⚡ TL;DR Trying to get the median for every sliding window of…
The O(n) Club: Shortest Path in Binary Matrix—Why BFS Is Your Best Frenemy
The O(n) Club: Shortest Path in Binary Matrix—Why BFS Is Your Best Frenemy ⚡ TL;DR Need the shortest way from top-left to bottom-right in a…
The O(n) Club: Consecutive Subsequence Splitting—Java-Only, Tears Optional
The O(n) Club: Consecutive Subsequence Splitting—Java-Only, Tears Optional ⚡ TL;DR Sorted array. Must split into consecutive chunks of 3+…
The O(n) Club: Old Man and the Sea of Zeros
The O(n) Club: Old Man and the Sea of Zeros ⚡ TL;DR Given a city grid of land (1) and water (0), you get one chance to turn water into land.…