6 min read Kadane’s algorithm finds the largest contiguous subarray sum in a single pass, and the interview really lives in the follow-ups: all-negative inputs, returning indices, and the product and circular variants. Read article
7 min read Why 3Sum sorts first, where the duplicate skips go, and what interviewers ask once your two-pointer solution compiles. Read article
5 min read The no-division array question rewards a prefix-and-suffix pass, and the O(1) space follow-up is where most candidates stumble. Read article
6 min read Two Sum looks trivial, but the jump from the brute-force pair check to the one-pass hash map is the exact skill interviewers are screening for. Read article
What's missing, wrong, or worth adding? One line helps.
Sent — thank you. We read every one.
