# Length Of The Longest Valid Substring: Interview Notes
Length Of The Longest Valid Substring shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A substring is valid if none of a forbidden list appears inside it. Walk right to left (or a sliding window) and, for each right endpoint, find the leftmost start that avoids every forbidden word ending at or before right (check the last few characters since forbidden words are short).
## 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 * L) where L is max forbidden length.
## Common mistake
Rechecking the whole forbidden list as a substring search from scratch at every index (too slow) or forbidding only exact equality with the whole 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 undetectable AI interview copilot.