# Longest Substring With At Most Two Distinct Characters: Walkthrough
Longest Substring With At Most Two Distinct 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 frequency map (or two remembered characters). Grow right, shrink left when the map has more than two keys, and track the max window.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Allowing three distinct characters, or using a set without frequencies so you cannot know when a character has left the window.
## 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 real-time AI interview assistant for live interviews.