Leetcode Problem 1190. Reverse Substrings Between Each Pair of Parentheses

1190. Reverse Substrings Between Each Pair of Parentheses

Leetcode Solutions

Initialize an empty stack to store characters.
Iterate over each character in the input string.
If the current character is not a closing parenthesis, push it onto the stack.
If the current character is a closing parenthesis: a. Pop characters from the stack until an opening parenthesis is encountered. b. Store the popped characters in a temporary string and reverse it. c. Push the reversed substring back onto the stack.
After the iteration, pop all characters from the stack and append them to the result string in reverse order.
Return the result string.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen