Pattern recognition: the secret weapon of top coders
Quick context (why you're writing this)
Here's the thing: I was stuck on a LeetCode medium‑level problem for longer than I care to admit. The task was to find the longest substring without repeating characters. I started with the obvious brute‑force approach—nested loops, a set to check duplicates, and a lot of “if this, then that” checks. After two hours of watching my solution time‑out on the biggest test case, I felt that familiar sinking feeling: I’m missing something obvious.
Then, while staring at the screen, I noticed something: every time I hit a duplicate character, I was throwing away all the work I’d done so far and starting over from the next index. It felt wasteful, like I was re‑building a house from scratch each time a nail bent. That’s when the pattern clicked: I wasn’t looking at substrings; I was looking at a window that could slide forward, adjusting its edges as needed.
That moment—realizing the problem was really about maintaining a valid window—saved me hours of frustration and turned a confusing mess into a clean O(n) solution.
