8 views
# Valid Parentheses Stack (Practice 4742): Walkthrough Interviewers love valid parentheses stack because it checks whether you can state the invariant before coding. Here is a compact rehearsal note. ## Approach Push opens; pop on close and check match. ```python def is_valid(s): pair = {')':'(', ']':'[', '}':'{'} st = [] for c in s: if c in pair.values(): st.append(c) elif not st or st.pop() != pair[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 [https://www.linkjob.ai/](https://www.linkjob.ai/).