Mid/SeniorStackString

Reverse Substrings Between Each Pair of Parentheses

You are given a string s that consists of lower case English letters and brackets.

Reverse the strings in each pair of matching parentheses, starting from the innermost one.

Your result should not contain any brackets.

Example 1
Inputs = "(abcd)"
Output"dcba"
The string inside the only pair of parentheses is reversed, producing "dcba" without brackets.
Example 2
Inputs = "(u(love)i)"
Output"iloveu"
The substring "love" is reversed first, then the whole string is reversed.

Constraints

  • 1 <= s.length <= 2000
  • s only contains lower case English characters and parentheses.
  • It is guaranteed that all parentheses are balanced.

Asked at 9 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate