The coverage counter behind Minimum Window Substring
6 min read Walking Minimum Window Substring from the brute-force baseline to the O(n) sliding window that tracks coverage with a single counter. Read article
Coding Interview Questions
Coding Interview Questions
How the sliding window solves Longest Substring Without Repeats
6 min read The two-pointer window that turns a quadratic substring scan into one linear pass, plus the stale-index guard that quietly breaks the fast version. Read article
