# Length Of The Longest Alphabetical Continuous Substring: Explained
Length Of The Longest Alphabetical Continuous Substring shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A contiguous substring is alphabetical-continuous when each next character is the next letter (like 'abc' or 'xyz'). Scan once, extend a run while s[i] == s[i-1] + 1, and track the longest run.
## 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 wrap-around from 'z' to 'a', or counting non-contiguous increasing subsequences.
## 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 tool for job interviews.