Your question is Reverse Parenthesized Substrings. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
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.
def reverse_parentheses(s):