Minimum number of Parentheses to be added to make it valid
Last Updated :
09 May, 2023
Given a string S of parentheses '(' or ')' where, 0\leq len(S)\leq 1000 . The task is to find a minimum number of parentheses '(' or ')' (at any positions) we must add to make the resulting parentheses string is valid.
Examples:
Input: str = "())"
Output: 1
One '(' is required at beginning.
Input: str = "((("
Output: 3
Three ')' is required at end.Approach 1: Iterative Approach
We keep the track of balance of the string i:e the number of '(' minus the number of ')'. A string is valid if its balance is 0, and also every prefix has non-negative balance.
Now, consider the balance of every prefix of S. If it is ever negative (say, -1), we must add a '(' bracket at the beginning. Also, if the balance of S is positive (say, +P), we must add P times ')' brackets at the end.
Below is the implementation of the above approach:
C++
// C++ Program to find minimum number of '(' or ')'
// must be added to make Parentheses string valid.
#include <bits/stdc++.h>
using namespace std;
// Function to return required minimum number
int minParentheses(string p)
{
// maintain balance of string
int bal = 0;
int ans = 0;
for (int i = 0; i < p.length(); ++i) {
bal += p[i] == '(' ? 1 : -1;
// It is guaranteed bal >= -1
if (bal == -1) {
ans += 1;
bal += 1;
}
}
return bal + ans;
}
// Driver code
int main()
{
string p = "())";
// Function to print required answer
cout << minParentheses(p);
return 0;
}
// Java Program to find minimum number of '(' or ')'
// must be added to make Parentheses string valid.
public class GFG {
// Function to return required minimum number
static int minParentheses(String p)
{
// maintain balance of string
int bal = 0;
int ans = 0;
for (int i = 0; i < p.length(); ++i) {
bal += p.charAt(i) == '(' ? 1 : -1;
// It is guaranteed bal >= -1
if (bal == -1) {
ans += 1;
bal += 1;
}
}
return bal + ans;
}
public static void main(String args[])
{
String p = "())";
// Function to print required answer
System.out.println(minParentheses(p));
}
// This code is contributed by ANKITRAI1
}
# Python3 Program to find
# minimum number of '(' or ')'
# must be added to make Parentheses
# string valid.
# Function to return required
# minimum number
def minParentheses(p):
# maintain balance of string
bal=0
ans=0
for i in range(0,len(p)):
if(p[i]=='('):
bal+=1
else:
bal+=-1
# It is guaranteed bal >= -1
if(bal==-1):
ans+=1
bal+=1
return bal+ans
# Driver code
if __name__=='__main__':
p = "())"
# Function to print required answer
print(minParentheses(p))
# this code is contributed by
# sahilshelangia
// C# Program to find minimum number
// of '(' or ')' must be added to
// make Parentheses string valid.
using System;
class GFG
{
// Function to return required
// minimum number
static int minParentheses(string p)
{
// maintain balance of string
int bal = 0;
int ans = 0;
for (int i = 0; i < p.Length; ++i)
{
bal += p[i] == '(' ? 1 : -1;
// It is guaranteed bal >= -1
if (bal == -1)
{
ans += 1;
bal += 1;
}
}
return bal + ans;
}
// Driver code
public static void Main()
{
string p = "())";
// Function to print required answer
Console.WriteLine(minParentheses(p));
}
}
// This code is contributed
// by Kirti_Mangal
<?php
// PHP Program to find minimum number of
// '(' or ')' must be added to make
// Parentheses string valid.
// Function to return required minimum number
function minParentheses($p)
{
// maintain balance of string
$bal = 0;
$ans = 0;
for ($i = 0; $i < strlen($p); ++$i)
{
if ($p[$i] == '(' )
$bal += 1 ;
else
$bal += -1;
// It is guaranteed bal >= -1
if ($bal == -1)
{
$ans += 1;
$bal += 1;
}
}
return $bal + $ans;
}
// Driver code
$p = "())";
// Function to print required answer
echo minParentheses($p);
// This code is contributed by ita_c
?>
<script>
// Javascript Program to find minimum number of '(' or ')'
// must be added to make Parentheses string valid.
// Function to return required minimum number
function minParentheses( p)
{
// maintain balance of string
var bal = 0;
var ans = 0;
for (var i = 0; i < p.length; ++i) {
bal += p[i] == '(' ? 1 : -1;
// It is guaranteed bal >= -1
if (bal == -1) {
ans += 1;
bal += 1;
}
}
return bal + ans;
}
var p = "())";
// Function to print required answer
document.write( minParentheses(p));
// This code is contributed by SoumikMondal
</script>
Complexity Analysis:
- Time Complexity: O(N), where N is the length of S.
- Space Complexity: O(1).
Approach 2: Using Stack
We can also solve this problem using a stack data structure.
- We push the index of every '(' character onto the stack, and whenever we encounter a ')' character, we pop the top index from the stack.
- This indicates that the corresponding '(' has been paired with the current ')'.
- If at any point the stack is empty and we encounter a ')' character, it means we need to add a '(' character to the beginning of the string to make it valid.
- Similarly, if after processing the entire string there are still indices left in the stack, it means we need to add ')' characters to the end of the string to make it valid.
Below is the implementation of the above approach:
C++
// C++ Program to find minimum number of '(' or ')'
// must be added to make Parentheses string valid.
#include <bits/stdc++.h>
using namespace std;
// Function to return required minimum number
int minParentheses(string p)
{
stack<int> stk;
int ans = 0;
for (int i = 0; i < p.length(); ++i) {
if (p[i] == '(') {
stk.push(i);
}
else {
if (!stk.empty()) {
stk.pop();
}
else {
ans += 1;
}
}
}
// add remaining '(' characters to end
ans += stk.size();
return ans;
}
// Driver code
int main()
{
string p = "())";
// Function to print required answer
cout << minParentheses(p);
return 0;
}
// This code is contributed by user_dtewbxkn77n
import java.util.Stack;
public class Main {
// Function to return required minimum number
public static int minParentheses(String p) {
Stack<Integer> stk = new Stack<>();
int ans = 0;
for (int i = 0; i < p.length(); ++i) {
if (p.charAt(i) == '(') {
stk.push(i);
} else {
if (!stk.empty()) {
stk.pop();
} else {
ans += 1;
}
}
}
// add remaining '(' characters to end
ans += stk.size();
return ans;
}
// Driver code
public static void main(String[] args) {
String p = "())";
// Function to print required answer
System.out.println(minParentheses(p));
}
}
def minParentheses(p):
stk = []
ans = 0
for i in range(len(p)):
if p[i] == '(':
stk.append(i)
else:
if len(stk) > 0:
stk.pop()
else:
ans += 1
# add remaining '(' characters to end
ans += len(stk)
return ans
# Driver code
p = "())"
# Function to print required answer
print(minParentheses(p))
using System;
using System.Collections.Generic;
public class Program {
// Function to return required minimum number
public static int MinParentheses(string p) {
Stack<int> stk = new Stack<int>();
int ans = 0;
for (int i = 0; i < p.Length; ++i) {
if (p[i] == '(') {
stk.Push(i);
} else {
if (stk.Count > 0) {
stk.Pop();
} else {
ans += 1;
}
}
}
// add remaining '(' characters to end
ans += stk.Count;
return ans;
}
// Driver code
public static void Main() {
string p = "())";
// Function to print required answer
Console.WriteLine(MinParentheses(p));
}
}
// Function to return required minimum number
function minParentheses(p) {
let stk = [];
let ans = 0;
for (let i = 0; i < p.length; i++) {
if (p[i] === '(') {
stk.push(i);
} else {
if (stk.length > 0) {
stk.pop();
} else {
ans += 1;
}
}
}
// add remaining '(' characters to end
ans += stk.length;
return ans;
}
// Driver code
let p = "())";
// Function to print required answer
console.log(minParentheses(p));
Time Complexity: O(n), where n is the length of the input string.
Space Complexity: O(n)
Approach 3: Using string manipulation
- Continuously search for the substring "()" in the input string.
- If the substring "()" is found, replace it with an empty string.
- Repeat steps 1 and 2 until the substring "()" can no longer be found.
- The length of the resulting string is the minimum number of parentheses needed to make the string valid.
Here is the implementation of above approach:
C++
#include <iostream>
#include <string>
using namespace std;
int minParentheses(string s) {
while (s.find("()") != -1) {
s.replace(s.find("()"), 2, "");
}
return s.length();
}
int main() {
string s = "(((";
cout << minParentheses(s) << endl;
return 0;
}
public class Solution {
public static int minParentheses(String s) {
while (s.indexOf("()") != -1) {
s = s.replace("()", "");
}
return s.length();
}
public static void main(String[] args) {
String s = "(((";
System.out.println(minParentheses(s));
}
}
def minParentheses(s: str) -> int:
while s.find("()") != -1:
s = s.replace("()", "")
return len(s)
# Driver code
s = "((("
print(minParentheses(s))
using System;
public class Program {
public static void Main() {
string s = "(((";
Console.WriteLine(minParentheses(s));
}
public static int minParentheses(string s) {
while (s.IndexOf("()") != -1) {
s = s.Replace("()", "");
}
return s.Length;
}
}
function minParentheses(s) {
while(s.indexOf("()") != -1) {
s = s.replace("()", "");
}
return s.length;
}
// Driver code
let s = "(((";
console.log(minParentheses(s));
Time Complexity: O(n^2) where n is the length of the input string. This is because the find() and replace() operations are called repeatedly in a loop.
Auxiliary Space: O(n) where n is the length of the input string. This is because the string s is being replaced in place and no additional data structures are being used.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem