← All series
🧩

Series

LeetCode Notebook

Problems I've solved, with the reasoning spelled out — pattern recognition, the naive approach, the optimization, and the complexity math.

2 entries · growing5 min total#algorithms#data-structures#interview-prep
3 min read🔀 Remix

My remix: Two Sum, but it's 100M numbers and you get 512 MB

I made up my own follow-up: what happens to the hash-map solution when the array doesn't fit in memory? Duplicates, negatives, and external partitioning.

#leetcode#algorithms#memory
1 min read

LeetCode #1 — Two Sum, and the hash map reflex

The classic warm-up: from O(n²) brute force to a one-pass hash map, and the pattern it teaches you to spot everywhere.

#leetcode#arrays#hash-map