Skip to content

Practice Remove Outermost Parentheses

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1021
LeetCode Problem

Remove Outermost Parentheses

StringStack

Problem Statement

A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. A valid parentheses string s is primitive if it is nonempty, and there does not exist a way to split it into s = A + B, with A and B nonempty valid parentheses strings. Given a valid parentheses string s, consider its primitive decomposition: s = P1 + P2 + ... + Pk, where Pi are primitive valid parentheses strings. Return s after removing the outermost parentheses of every primitive string in the primitive decomposition of s.

Source: Remove Outermost Parentheses on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "(()())(())"
Output
"()()()"

# Example 2

Input
s = "(()())(())(()(()))"
Output
"()()()()(())"

# Example 3

Input
s = "()()"
Output
""

Constraints

1 <= s.length <= 10^5
s[i] is either '(' or ')'.
s is a valid parentheses string.

Related LeetCode Problems

Practice more problems similar to Remove Outermost Parentheses.

20 Valid Parentheses Easy32 Longest Valid Parentheses Hard3 Longest Substring Without Repeating Characters Medium5 Longest Palindromic Substring Medium6 Zigzag Conversion Medium
← Previous Number of EnclavesNext → Sum of Root To Leaf Binary Numbers

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free