The O(n) Club: Pascal’s Triangle — Why Is Everything a 1?
The O(n) Club: Pascal’s Triangle — Why Is Everything a 1? ⚡ TL;DR Pascal’s Triangle is that legendary integer pyramid where each number…
The Mutex Club: Writing Your Own Thread Barrier
If mutexes are the bouncers of parallel programming, barriers are more like your group chat’s trip coordinator—no one moves until everyone…
The Mutex Club: Using Semaphores for Controlled Access
Key Insights # Semaphores vs. Mutexes Think of a mutex as the grumpy bouncer who only lets one person into the VIP lounge at a time. A…
The O(n) Club: House Robber II: When Your Path Turns Circular (and Paranoid)
The O(n) Club: House Robber II—When Your Path Turns Circular (and Paranoid) ⚡ TL;DR Old problem: Rob a line of houses, don’t trip two neighbor…
The O(n) Club: Evaluate Division – Connect the Dots, Multiply the Drama
The O(n) Club: Evaluate Division – Connect the Dots, Multiply the Drama ⚡ TL;DR Take some equations like a / b = 2.0, make a directed,…
The Mutex Club: CountDownLatch: Waiting for Threads Like a Boss
Why CountDownLatch Still Has Devs Talking Ever waited for the slowest kid in class before heading to lunch? Java’s CountDownLatch is that last…
The Mutex Club: Exchanger: When Threads Swap Data
Ever watch two threads do a data swap in perfect synchronicity? Java’s Exchanger is like a secret handshake: atomic, bidirectional, and…
The Mutex Club: Using Semaphores for Controlled Access
The Mutex Club: Semaphores, Gatekeepers, & the Real Party in Concurrency ## Why Are There So Many Bouncers in the Club? Ever tried…
The O(n) Club: Longest Palindromic Subsequence: Where Dynamic Programming Eats Exponential Time For Breakfast
The O(n) Club: Longest Palindromic Subsequence — Where Dynamic Programming Eats Exponential Time For Breakfast ⚡ TL;DR Given a string,…
The O(n) Club: Missing Number — How to Outsmart That One Number Who Didn’t RSVP
The O(n) Club: Missing Number — How to Outsmart That One Number Who Didn’t RSVP ⚡ TL;DR One number from to n ditched your array —…