Leetcode 1190. Reverse Substrings Between Each Pair of Parentheses

Given a balanced string of lowercase letters and parentheses, reverse the substrings inside each matched pair from the innermost outward and return the resulting string with all parentheses removed. The core challenge is correctly handling nested reversals (a common approach uses a stack or recursion) within s.length ≤ 2000.