The O(n) Club: Surviving the Longest Valid Parentheses Without Therapy
The O(n) Club: Surviving the Longest Valid Parentheses Without Therapy ⚡ TL;DR You get a string of ‘(‘ and ‘)’. Your…
The O(n) Club: Copy List with Random Pointer – How to Not Clone a Dumpster Fire
The O(n) Club: Copy List with Random Pointer – How to Not Clone a Dumpster Fire ⚡ TL;DR Linked list problem but with a spicy random pointer:…
The O(n) Club: Top K Frequent Elements—How to Nail This Without Sorting Yourself Into Oblivion
The O(n) Club: Top K Frequent Elements—How to Nail This Without Sorting Yourself Into Oblivion ⚡ TL;DR Given an array, return the k most…
The O(n) Club: Min Stack: The Two-Stack Power Move Explained
The O(n) Club: Min Stack — The Two-Stack Power Move Explained ⚡ TL;DR This interview isn’t a trust fall: don’t scan the stack to get the min.…
The O(n) Club: Decode String — When Brackets Join the Circus
The O(n) Club: Decode String — When Brackets Join the Circus ⚡ TL;DR Unravel those cryptic nested bracket strings like 3[a2[c]] into…
The O(n) Club: Rotate Array: The Triple Reverse Shuffle You Secretly Hate
The O(n) Club: Rotate Array—The Triple Reverse Shuffle You Secretly Hate ⚡ TL;DR Rotate your array to the right by k steps. Don’t copy…
The O(n) Club: Maximum Subarray — Kadane’s Algorithm for Hot Streaks Only
The O(n) Club: Maximum Subarray — Kadane’s Algorithm for Hot Streaks Only ⚡ TL;DR You want the largest sum you can get by picking a…
The O(n) Club: Longest Substring Without Repeating Characters: Surviving the Duplicate Juggle
The O(n) Club: Longest Substring Without Repeating Characters — Surviving the Duplicate Juggle ⚡ TL;DR Asked for the longest substring…