# Valid Parentheses Stack (Practice 5049): Notes

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

Push opening brackets and pop only when the matching closer arrives.

```python
def is_valid(s):
st=[];m={')':'(',']':'[','}':'{'}
for c in s:
if c in m:
if not st or st.pop()!=m[c]: return False
else: st.append(c)
return not st
```

## Complexity

Linear in the dominant input size for the scan; heap/tree variants add a log factor.

## Interview pitfalls

State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.

## Practicing out loud

Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see www.linkjob.ai.