Reverse Parenthesized Substrings | Dataford Interview Questions

Given a string s containing lowercase English letters and parentheses, repeatedly reverse the substring inside each matching pair of parentheses, starting from the innermost pair. Return the final string with all parentheses removed. The input is guaranteed to contain balanced parentheses.

Constraints

1 <= len(s) <= 10^5
s consists of lowercase English letters and parentheses only
Parentheses in s are balanced

Function Signature

def reverse_parentheses(s):

Your question is Reverse Parenthesized Substrings. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= len(s) <= 10^5
s consists of lowercase English letters and parentheses only
Parentheses in s are balanced

Function Signature

def reverse_parentheses(s):

Your question is Reverse Parenthesized Substrings. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.