# Valid Parentheses Stack (Practice 5021): Drill Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note. ## Approach push opens, match closes. ```python def valid(s): m={')':'(',']':'[','}':'{'}; st=[] for c in s: if c in m.values(): st.append(c) elif not st or st.pop()!=m[c]: return False 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 [AI assistant for technical interviews](https://www.linkjob.ai/).
Published with deed.pageReport abuse