# Longest Valid Parentheses: Explained
Longest Valid Parentheses shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Stack of indices (start with -1) or two-pass left/right counters; pop on ')', and the gap to the new top is a valid length.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Counting raw balance without resetting when it goes negative, which overcounts prefixes.
## 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 www.linkjob.ai.