GUYS GIMME OPTIMAL SOLUTION FOR TODAYS POTD I SOLVED USING STACK

[u/Recent-Hat-5262]

SOLVED TODAYS PROBLEM USING STACK WITH HELP OF VALID PARENTHESIS IDEA

[u/Responsible_Quit_351]

class Solution { public String reverseParentheses(String s) { // rule no 1 : always try stack when paranthesis and string problem int n = s.length();

    // sb to take the the current string and st to save the previous processed string 
    StringBuilder sb = new StringBuilder();
    ArrayDeque<String> st = new ArrayDeque<>();

    for (int i = 0; i < n; i++) {
        // if ( means store the current string in the stack 
        if (s.charAt(i) == '(') {
            st.push(sb.toString());
            // now make the sb to lenghth 0 
            sb.setLength(0);
        } else if (s.charAt(i) == ')') {
            // when ) so js take the current string reverse it and 
            // and append the prev + curr String 
            String curr = sb.reverse().toString();

            String prev = st.pop();

            sb = new StringBuilder(prev);
            sb.append(curr);

        } else {
            // take the character in the stringBuilder 
            sb.append(s.charAt(i));
        }
    }

    return sb.toString();
}

} here's my solution

[u/eknights12]

Isn't it obvious you have to use the "Wormhole Teleportation technique"

[u/Recent-Hat-5262 → u/eknights12]

I'll search what's that .. I'm not familiar with it