dsa4 min read
Maximum Subarray — Kadane Algorithm for FAANG Interviews
LeetCode 53 — find the contiguous subarray with the largest sum in O(n). Kadane is the dynamic programming gateway problem at Amazon, Google, and Meta.
Read →
All Posts
1582 articles
dsa13 min read
Move Zeroes (LeetCode 283) — Two Pointers, and the Write Count
LeetCode 283 moves every zero to the end of an array in place, keeping the other elements in order. Two pointers do it in one pass — but the problem also asks you to minimise the total number of operations, and that is where the overwrite and swap versions stop being interchangeable.
Read →
dsa4 min read
Plus One — Carry Propagation in Arrays
LeetCode 66 — increment a large integer represented as a digit array, propagating the carry. The deceptively simple FAANG warmup that catches careless coders.
Read →
dsa4 min read
Merge Sorted Array — Backwards Two-Pointer for In-Place Merging
LeetCode 88 — merge nums2 into nums1 in place by walking from the back. The classic two-pointer interview question at Meta and Microsoft.
Read →
dsa12 min read
Remove Duplicates from Sorted Array — Write Pointer Pattern Explained [Easy]
Master the write pointer pattern — the canonical technique for in-place array modification. Full walkthrough of LeetCode 26 with visual dry run, common mistakes, and the LC 80 generalization. Python and JavaScript solutions included.
Read →
Page 43 of 317