# 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 starting with -1: push on '(', on ')' pop and the current length is i-stack.top (or reset the base to i if the stack is empty).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) 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 a balanced total of parentheses that is not a contiguous substring.

## 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.