LIFO for matching, undo, and next-greater patterns.

stack<char> st;
for (char c : s) {
    if (/* open */) st.push(c);
    else {
        if (st.empty() || st.top() != need) return false;
        st.pop();
    }
}
return st.empty();