Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.