Blog
Tutorials, guides, and insights to help you become a better developer.
A rotated sorted array still has structure you can exploit. Learn the one insight that makes O(log n) search possible — and how to handle duplicates.
AdminJanuary 23, 20264 min read
Binary search isn't just for sorted arrays. Learn to search the range of possible answers to crack Koko Eating Bananas, Ship Packages, and a whole category of hard problems.
AdminJanuary 20, 20267 min read
Two pointers, one pass, O(n) — learn how the variable-size sliding window grows and shrinks to solve substring and subarray problems efficiently.
AdminJanuary 15, 20264 min read
Stop re-summing from scratch — the fixed-size sliding window reduces O(n·k) nested loops to a single O(n) pass by adding one element and dropping one.
AdminJanuary 12, 20264 min read
Most people reach for the nested loop on Two Sum — here's why the hash map pattern is the interview move, plus 3Sum and sorted variants.
AdminJanuary 9, 20265 min read
AdminJanuary 8, 202611 min read
PreviousPage 4 of 4