DSA Level 2 Data Structures Stacks Reverse Substrings Between Each Pair Of Parentheses

Reverse Substrings Between Each Pair Of Parentheses

medium

1: You are given a string s that consists of lower case English letters and brackets. 
2: Reverse the strings in each pair of matching parentheses, starting from the innermost one.
3: Your result should not contain any brackets.

Example
(abcd) -&gt; dcba
(u(love)i) -&gt; iloveu
(gni(pc(do))ep) -&gt; pepcoding

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

1: 0 &lt;= s.length &lt;= 2000
2: s only contains lower case English characters and parentheses
3: It's guaranteed that all parentheses are balanced.

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

(gni(pc(do))ep)

Output

pepcoding

Score Of Parentheses

Minimum Remove To Make Valid Parentheses

Related Questions

medium Next Greater Element To The Right easy Next Greater Element I easy Next Greater Element Ii medium Validate Stack Sequences medium Design A Stack With Increment Operation medium Minimum Add To Make Parentheses Valid medium Score Of Parentheses medium Minimum Remove To Make Valid Parentheses medium Online Stock Span medium Exclusive Time Of Functions medium 132 Pattern medium Remove K Digits medium Asteroid Collision medium Remove Duplicate Letters hard Largest Area Histogram 2 hard Maximal Rectangle