Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Reduce string by removing outermost parenthesis from each primitive substring

  • Last Updated : 17 May, 2021

Given a string S of valid parentheses “(“ and “)”, the task is to print the string obtained by removing the outermost parentheses of every primitive substring from S.

A valid parentheses substring S is primitive if it is non-empty, and cannot be split into two or more non-empty substrings which are also a valid parentheses.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Examples:



Input: S = “(()())(())()” 
Output: ()()() 
Explanation: The input string is “(()())(())()” can be decomposed into primitive susbstrings “(()())” + “(())”+”()”. After removing outermost parentheses of each priiimitive substrings, the string obtained is “()()” + “()” = “()()()”

Input: S = “((()())(())(()(())))” 
Output: ()()()()(())

 

Approach: Follow the steps below to solve the problem:

  1. Initialize a variable count to store the number of opening parentheses, i.e. ‘(‘.
  2. Add every ‘(‘ to the result if count is greater than 0, i.e. add all ‘(‘ after the first ‘(‘ of a primitive substring is encountered.
  3. Add every ‘)’ to the result if count is greater than 0, i.e. add all ‘)’ before the last ‘)’ of a primitive substring is encountered.
  4. Finally, print the resultant string obtained.

Below is the implementation of the above approach-

C++




// C++ program to implement the
// above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to remove the outermost
// parentheses of every primitive
// substring from the given string
string removeOuterParentheses(string S)
{
 
    // Stores the resultant string
    string res;
 
    // Stores the count of
    // opened parentheses
    int count = 0;
 
    // Traverse the string
    for (char c : S) {
 
        // If opening parenthesis is
        // encountered and their
        // count exceeds 0
        if (c == '(' && count++ > 0)
 
            // Include the character
            res += c;
 
        // If closing parenthesis is
        // encountered and their
        // count is less than count
        // of opening parentheses
        if (c == ')' && count-- > 1)
 
            // Include the character
            res += c;
    }
 
    // Return the resultant string
    return res;
}
 
// Driver Code
int main()
{
    string S = "(()())(())()";
    cout << removeOuterParentheses(S);
}
Java



// Java program to implement the
// above approach
import java.io.*;
class GFG{
   
// Function to remove the outermost
// parentheses of every primitive
// substring from the given string
static String removeOuterParentheses(String S)
{
  // Stores the resultant
  // string
  String res = "";
 
  // Stores the count of
  // opened parentheses
  int count = 0;
 
  // Traverse the string
  for (int c = 0;
           c < S.length(); c++)
  {
    // If opening parenthesis is
    // encountered and their
    // count exceeds 0
    if (S.charAt(c) == '(' &&
        count++ > 0)
 
      // Include the character
      res += S.charAt(c);
 
    // If closing parenthesis is
    // encountered and their
    // count is less than count
    // of opening parentheses
    if (S.charAt(c) == ')' &&
        count-- > 1)
 
      // Include the character
      res += S.charAt(c);
  }
 
  // Return the resultant string
  return res;
}
 
// Driver Code
public static void main(String[] args)
{
  String S = "(()())(())()";
  System.out.print(removeOuterParentheses(S));
}
}
 
// This code is contributed by Chitranayal
Python3



# Python3 program to implement the
# above approach
 
# Function to remove the outermost
# parentheses of every primitive
# substring from the given string
def removeOuterParentheses(S):
     
    # Stores the resultant string
    res = ""
 
    # Stores the count of
    # opened parentheses
    count = 0
 
    # Traverse the string
    for c in S:
         
        # If opening parenthesis is
        # encountered and their
        # count exceeds 0
        if (c == '(' and count > 0):
 
            # Include the character
            res += c
 
        # If closing parenthesis is
        # encountered and their
        # count is less than count
        # of opening parentheses
        if (c == '('):
            count += 1
        if (c == ')' and count > 1):
 
            # Include the character
            res += c
             
        if (c == ')'):
          count -= 1
     
    # Return the resultant string
    return res
 
# Driver Code
if __name__ == '__main__':
     
    S = "(()())(())()"
     
    print(removeOuterParentheses(S))
 
# This code is contributed by SURENDRA_GANGWAR
C#



// C# program to implement
// the above approach 
using System;
 
class GFG{
    
// Function to remove the outermost
// parentheses of every primitive
// substring from the given string
static string removeOuterParentheses(string S)
{
   
  // Stores the resultant
  // string
  string res = "";
  
  // Stores the count of
  // opened parentheses
  int count = 0;
  
  // Traverse the string
  for(int c = 0; c < S.Length; c++)
  {
     
    // If opening parenthesis is
    // encountered and their
    // count exceeds 0
    if (S == '(' &&
        count++ > 0)
  
      // Include the character
      res += S;
  
    // If closing parenthesis is
    // encountered and their
    // count is less than count
    // of opening parentheses
    if (S == ')' &&
        count-- > 1)
  
      // Include the character
      res += S;
  }
  
  // Return the resultant string
  return res;
}
  
// Driver Code
public static void Main()
{
  string S = "(()())(())()";
   
  Console.Write(removeOuterParentheses(S));
}
}
 
// This code is contributed by sanjoy_62
Javascript



<script>
 
// Javascript program to implement the
// above approach
 
// Function to remove the outermost
// parentheses of every primitive
// substring from the given string
function removeOuterParentheses(S)
{
 
// Stores the resultant
// string
let res = "";
 
// Stores the count of
// opened parentheses
let count = 0;
 
// Traverse the string
for (let c = 0;
        c < S.length; c++)
{
    // If opening parenthesis is
    // encountered and their
    // count exceeds 0
    if (S.charAt(c) == '(' &&
        count++ > 0)
 
    // Include the character
    res += S.charAt(c);
 
    // If closing parenthesis is
    // encountered and their
    // count is less than count
    // of opening parentheses
    if (S.charAt(c) == ')' &&
        count-- > 1)
 
    // Include the character
    res += S.charAt(c);
}
 
// Return the resultant string
return res;
}
 
// Driver Code
 
let S = "(()())(())()";
document.write(removeOuterParentheses(S));
 
// This code is contributed by jana_sayantan.
</script>
Output: 
()()()
 
Time Complexity: O(N) 
Auxiliary Space: O(N)



My Personal Notes
arrow_drop_up
Previous
Find all the queens attacking the king in a chessboard
Next

Check if decimal representation of Binary String is divisible by 9 or not
Recommended Articles
Page :
Find a valid parenthesis sequence of length K from a given valid parenthesis sequence
10, Sep 20
Print the string obtained after removal of outermost parentheses
28, Dec 20
Minimize length by removing subsequences forming valid parenthesis from a given string
13, Jan 21
Minimize length of a given string by removing subsequences forming valid parenthesis
26, Jan 21
Reverse substrings between each pair of parenthesis
23, Dec 19
Reduce the string by removing K consecutive identical characters
02, Nov 18
Minimize length of a string by removing occurrences of another string from it as a substring
19, Jan 21
Count minimum substring removals required to reduce string to a single distinct character
07, Dec 20
Find maximum depth of nested parenthesis in a string
26, Feb 15
Reduce the number to minimum multiple of 4 after removing the digits
06, Dec 19
Reduce an array to a single element by repeatedly removing larger element from a pair with absolute difference at most K
08, Mar 21
Primitive root of a prime number n modulo n
03, Feb 17
Find the number of primitive roots modulo prime
21, Nov 18
Primitive Abundant Number
26, Jun 20
Check if a string consisting only of a, b, c can be made empty by removing substring "abc" recursively
14, Jul 21
Maximized partitions of a string such that each character of the string appears in one substring
15, Sep 20
Lengths of maximized partitions of a string such that each character of the string appears in one substring
15, Sep 20
Partition given string in such manner that i'th substring is sum of (i-1)'th and (i-2)'th substring
15, Feb 18
Minimum removals to make a string concatenation of a substring of 0s followed by a substring of 1s
14, Dec 20
Check if a string can be split into two substrings such that one substring is a substring of the other
23, Dec 20
Count occurrences of substring X before every occurrence of substring Y in a given string
16, May 21
Find if a given string can be represented from a substring by iterating the substring “n” times
12, Jan 15
Identify and mark unmatched parenthesis in an expression
24, Nov 17
Number of balanced parenthesis substrings
18, Jul 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
IshwarGupta
@IshwarGupta
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!