The O(n) Club: Regions Cut By Slashes — Triangles, Therapy, and Union-Find
The O(n) Club: Regions Cut By Slashes — Triangles, Therapy, and Union-Find ⚡ TL;DR If your plan is to manually color each region, pour some…
The O(n) Club: Possible Bipartition: Or, How to Split Your Frenemies into Two Drama-Free Camps
The O(n) Club: Possible Bipartition — Or, How to Split Your Frenemies into Two Drama-Free Camps ⚡ TL;DR Split n people into two teams, so no…
The O(n) Club: Most Stones Removed with Same Row or Column: Stone-Crushing Group Therapy
The O(n) Club: Most Stones Removed with Same Row or Column — Stone-Crushing Group Therapy ⚡ TL;DR Imagine every stone is a bored dev at a…
The O(n) Club: Keys and Rooms—How to Unlock a Mansion Without Losing Your Mind (or Your Java Stack)
The O(n) Club: Keys and Rooms—How to Unlock a Mansion Without Losing Your Mind (or Your Java Stack) ⚡ TL;DR You wake up in room 0 of a…
The O(n) Club: Redundant Connection — Java’s Answer to Annoying Cycles
The O(n) Club: Redundant Connection — Java’s Answer to Annoying Cycles ⚡ TL;DR Some smart aleck added an extra edge to your tree, turning it…
The O(n) Club: Critical Connections in a Network: The Java Tarjan, Unplugged
The O(n) Club: Critical Connections in a Network — The Java Tarjan, Unplugged ⚡ TL;DR Finding bridges (aka critical cables) in a network:…
The O(n) Club: Network Delay Time, Java, and Your Shortcut to Dijkstra’s Fame
The O(n) Club: Network Delay Time, Java, and Your Shortcut to Dijkstra’s Fame ⚡ TL;DR Picture a network where you yell “coffee’s ready!” down…
The O(n) Club: Reconstruct Itinerary (JFK Edition): When Your DFS Hits Turbulence
The O(n) Club: Reconstruct Itinerary (JFK Edition): When Your DFS Hits Turbulence ⚡ TL;DR Given a suitcase full of flight tickets, your…
The O(n) Club: Is Your Graph Bipartite, or Just Awkward?
The O(n) Club: Is Your Graph Bipartite, or Just Awkward? ⚡ TL;DR Want to know if your graph can join the exclusive Bipartite Club? Try…
The O(n) Club: Counting Socially Awkward Provinces (LeetCode 547, With Less Anxiety)
The O(n) Club: Counting Socially Awkward Provinces (LeetCode 547, With Less Anxiety) ⚡ TL;DR Stuck with a matrix where isConnected[i][j] tells…