# Longest Substring Without Repeating Characters: Study Guide
Longest Substring Without Repeating Characters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sliding window with a last-seen index map: when s[r] repeats inside the window, jump left past the previous occurrence and update the max length.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Moving left only one step at a time after a repeat, which is still O(n) but slower in practice than jumping.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.