Available question text
Given a valid parentheses string, decompose it into primitive valid substrings and return the string formed by removing the outermost '(' and ')' of each primitive — typically done by a linear scan tracking nesting depth to skip the outermost parentheses.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Remove to Make Valid Parentheses
Coding
- Remove Invalid Parentheses
Coding · Backtracking · Breadth-First Search · String
- Check if a Parentheses String Can Be Valid
Coding
- Check if There Is a Valid Parentheses String Path
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1021. Remove Outermost Parentheses
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source