Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Number of closing brackets needed to complete a regular bracket sequence

  • Difficulty Level : Medium
  • Last Updated : 29 Apr, 2021

Given an incomplete bracket sequence S. The task is to find the number of closing brackets ‘)’ needed to make it a regular bracket sequence and print the complete bracket sequence. You are allowed to add the brackets only at the end of the given bracket sequence. If it is not possible to complete the bracket sequence, print “IMPOSSIBLE”.
Let us define a regular bracket sequence in the following way: 
 

  • Empty string is a regular bracket sequence.
  • If s is a regular bracket sequence, then (s) is a regular bracket sequence.
  • If s & t are regular bracket sequences, then st is a regular bracket sequence.

Examples: 
 

Input : str = “(()(()(” 
Output : (()(()())) 
Explanation : The minimum number of ) needed to make the sequence regular are 3 which are appended at the end.
Input : str = “())(()” 
Output : IMPOSSIBLE 
 

 

We need to add minimal number of closing brackets ‘)’, so we will count the number of unbalanced opening brackets and then we will add that amount of closing brackets. If at any point the number of the closing bracket is greater than the opening bracket then the answer is IMPOSSIBLE.
Below is the implementation of the above approach: 
 

C++




// C++ program to find number of closing
// brackets needed and complete a regular
// bracket sequence
#include <iostream>
using namespace std;
 
// Function to find number of closing
// brackets and complete a regular
// bracket sequence
void completeSuquence(string s)
{
    // Finding the length of sequence
    int n = s.length();
 
    int open = 0, close = 0;
 
    for (int i = 0; i < n; i++)
    {
        // Counting opening brackets
        if (s[i] == '(')
            open++;
        else
            // Counting closing brackets
            close++;
 
        // Checking if at any position the
        // number of closing bracket
        // is more then answer is impossible
        if (close > open)
        {
            cout << "Impossible" << endl;
            return;
        }
    }
 
    // If possible, print 's' and
    // required closing brackets.
    cout << s;
    for (int i = 0; i < open - close; i++)
        cout << ')';
    cout << endl;
}
 
// Driver code
int main()
{
    string s = "(()(()(";
    completeSuquence(s);
    return 0;
}
 
// This code is contributed by
// sanjeev2552
Java



// Java program to find number of closing
// brackets needed and complete a regular
// bracket sequence
class GFG {
 
    // Function to find number of closing
    // brackets and complete a regular
    // bracket sequence
    static void completeSequence(String s)
    {
        // Finding the length of sequence
        int n = s.length();
 
        int open = 0, close = 0;
 
        for (int i = 0; i < n; i++) {
 
            // Counting opening brackets
            if (s.charAt(i) == '(')
                open++;
            else
                // Counting closing brackets
                close++;
 
            // Checking if at any position the
            // number of closing bracket
            // is more then answer is impossible
            if (close > open) {
                System.out.print("IMPOSSIBLE");
                return;
            }
        }
 
        // If possible, print 's' and required closing
        // brackets.
        System.out.print(s);
        for (int i = 0; i < open - close; i++)
            System.out.print(")");         
    }
 
    // Driver code
    public static void main(String[] args)
    {
        String s = "(()(()(";
        completeSequence(s);
    }
}
Python 3



# Python 3 program to find number of
# closing brackets needed and complete
# a regular bracket sequence
 
# Function to find number of closing
# brackets and complete a regular
# bracket sequence
def completeSequence(s):
 
    # Finding the length of sequence
    n = len(s)
 
    open = 0
    close = 0
 
    for i in range(n):
 
        # Counting opening brackets
        if (s[i] == '('):
            open += 1
        else:
             
            # Counting closing brackets
            close += 1
 
        # Checking if at any position the
        # number of closing bracket
        # is more then answer is impossible
        if (close > open):
            print("IMPOSSIBLE")
            return
 
    # If possible, print 's' and
    # required closing brackets.
    print(s, end = "")
    for i in range(open - close):
        print(")", end = "")
 
# Driver code
if __name__ == "__main__":
     
    s = "(()(()("
    completeSequence(s)
 
# This code is contributed by ita_c
C#



// C# program to find number of closing
// brackets needed and complete a
// regular bracket sequence
using System;
 
class GFG
{
// Function to find number of closing
// brackets and complete a regular
// bracket sequence
static void completeSequence(String s)
{
    // Finding the length of sequence
    int n = s.Length;
 
    int open = 0, close = 0;
 
    for (int i = 0; i < n; i++)
    {
 
        // Counting opening brackets
        if (s[i] == '(')
            open++;
        else
            // Counting closing brackets
            close++;
 
        // Checking if at any position the
        // number of closing bracket
        // is more then answer is impossible
        if (close > open)
        {
            Console.Write("IMPOSSIBLE");
            return;
        }
    }
 
    // If possible, print 's' and
    // required closing brackets.
    Console.Write(s);
    for (int i = 0; i < open - close; i++)
        Console.Write(")");        
}
 
// Driver Code
static void Main()
{
    String s = "(()(()(";
    completeSequence(s);
}
}
 
// This code is contributed
// by ANKITRAI1
PHP



<?php
// PHP program to find number of closing
// brackets needed and complete a
// regular bracket sequence
 
// Function to find number of closing
// brackets and complete a regular
// bracket sequence
function completeSequence($s)
{
    // Finding the length of sequence
    $n = strlen($s);
    $open = 0;
    $close = 0;
 
    for ($i = 0; $i < $n; $i++)
    {
 
        // Counting opening brackets
        if ($s[$i] == '(')
            $open++;
        else
            // Counting closing brackets
            $close++;
 
        // Checking if at any position the
        // number of closing bracket
        // is more then answer is impossible
        if ($close > $open)
        {
            echo ("IMPOSSIBLE");
            return;
        }
    }
 
    // If possible, print 's' and
    // required closing brackets.
    echo ($s);
    for ($i = 0; $i < $open - $close; $i++)
        echo (")");    
}
 
// Driver Code
$s = "(()(()(";
completeSequence($s);
 
// This code is contributed
// by ajit
?>
Javascript



<script>
    // Javascript program to find number of closing
    // brackets needed and complete a
    // regular bracket sequence
     
    // Function to find number of closing
    // brackets and complete a regular
    // bracket sequence
    function completeSequence(s)
    {
        // Finding the length of sequence
        let n = s.length;
 
        let open = 0, close = 0;
 
        for (let i = 0; i < n; i++)
        {
 
            // Counting opening brackets
            if (s[i] == '(')
                open++;
            else
                // Counting closing brackets
                close++;
 
            // Checking if at any position the
            // number of closing bracket
            // is more then answer is impossible
            if (close > open)
            {
                document.write("IMPOSSIBLE");
                return;
            }
        }
 
        // If possible, print 's' and
        // required closing brackets.
        document.write(s);
        for (let i = 0; i < open - close; i++)
            document.write(")");        
    }
     
    let s = "(()(()(";
    completeSequence(s);
         
</script>
Output: 
(()(()()))
 

My Personal Notes
arrow_drop_up
Next

Check if the bracket sequence can be balanced with at most one change in the position of a bracket
Recommended Articles
Page :
Find index of closing bracket for a given opening bracket in an expression
23, Nov 17
Maximum Pairs of Bracket Sequences which can be concatenated to form a Regular Bracket Sequence
07, Jul 21
Check if the bracket sequence can be balanced with at most one change in the position of a bracket
17, Sep 19
Check if the bracket sequence can be balanced with at most one change in the position of a bracket | Set 2
28, Oct 19
Check if a Regular Bracket Sequence can be formed with concatenation of given strings
20, Sep 21
Convert an unbalanced bracket sequence to a balanced sequence
19, Aug 19
Minimum number of bracket reversals needed to make an expression balanced | Set - 2
05, Mar 19
Minimum number of bracket reversals needed to make an expression balanced
27, Oct 15
Count distinct regular bracket sequences which are not N periodic
12, Sep 20
Check if a given string can be converted to a Balanced Bracket Sequence
07, Jan 21
Find the lexicographical next balanced bracket sequence
29, May 19
Minimum sum possible of any bracket sequence of length N
31, Oct 18
Minimum Cost required to generate a balanced Bracket Sequence
21, Aug 20
Minimize cost to rearrange substrings to convert a string to a Balanced Bracket Sequence
14, Jan 21
Print Bracket Number
26, Feb 18
Number of balanced bracket subsequence of length 2 and 4
17, Oct 18
Number of balanced bracket expressions that can be formed from a string
06, Dec 18
Find an equal point in a string of brackets
08, Apr 17
Check if two expressions with brackets are same
07, Nov 17
Binary tree to string with brackets
10, Nov 17
Balance a string after removing extra brackets
03, Oct 18
Check if it is possible to obtain a Balanced Parenthesis by shifting brackets to either end at most K times
14, Apr 21
Minimum swaps to balance the given brackets at any index
17, Aug 21
Print all Balanced Brackets Strings that can be formed by replacing wild card '?'
28, Oct 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
indrajit1
@indrajit1
Vote for difficulty
Current difficulty :
Medium





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!