The O(n) Club: Word Ladder (LeetCode 127): BFS Wizardry Meets Word Jenga
The O(n) Club: Word Ladder (LeetCode 127): BFS Wizardry Meets Word Jenga ⚡ TL;DR Turn beginWord into endWord, one letter per move, using only…
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: 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…
The O(n) Club: Linked Lists Intersection — Y-Junctions, Off-By-One Fails, and Pointer Shenanigans
The O(n) Club: Linked Lists Intersection — Y-Junctions, Off-By-One Fails, and Pointer Shenanigans ⚡ TL;DR Given two singly linked lists that…
The O(n) Club: Anagrams Don’t Sort Themselves (But You Can Make Them Try)
The O(n) Club: Anagrams Don’t Sort Themselves (But You Can Make Them Try) ⚡ TL;DR Grab all the strings that are anagrams, put them in…
The O(n) Club: Letter Combinations of a Phone Number — Texting Like It’s 2001
The O(n) Club: Letter Combinations of a Phone Number — Texting Like It’s 2001 ⚡ TL;DR Your job: take a string of digits (2-9). Pretend…
The O(n) Club: Minimum Window Substring—How to Find a Needle in a Haystack Without Setting the Hay on Fire
The O(n) Club: Minimum Window Substring—How to Find a Needle in a Haystack Without Setting the Hay on Fire ⚡ TL;DR Squeeze every character…
The O(n) Club: Word Break — How DP Keeps You From Crying at Your Keyboard
The O(n) Club: Word Break — How DP Keeps You From Crying at Your Keyboard ⚡ TL;DR Can you cut a string into dictionary words without losing…
The O(n) Club: Word Break with Dynamic Programming (No More String-Induced Rage Quits)
The O(n) Club: Word Break with Dynamic Programming (No More String-Induced Rage Quits) ⚡ TL;DR Can you chop a string into valid dictionary…