Removing Enclosed Parentheses- Google Top Interview Questions
Problem Statement :
You are given a string s containing valid number of brackets "(", ")" and lowercase alphabet characters. Return the string after removing all outermost brackets that enclose the whole string.
Constraints
n ≤ 100,000 where n is the length of s
Example 1
Input
s = "(((abc)))"
Output
"abc"
Explanation
The three "((()))" brackets are outermost so we remove them.
Example 2
Input
s = "(((abc)))(d)"
Output
"(((abc)))(d)"
Explanation
There's no outermost brackets enclosing the string, so we return the same string.
Example 3
Input
s = "()"
Output
""
Explanation
We remove the outermost brackets.
Solution :
Solution in C++ :
string solve(string s) {
int pref = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
pref++;
} else {
break;
}
}
int suff = 0;
for (int i = 0; i < pref; i++) {
if (s[s.size() - 1 - i] == ')') {
suff++;
} else {
break;
}
}
int currDepth = pref;
int minDepth = min(pref, suff);
for (int i = pref; i < s.size() - pref; i++) {
if (s[i] == '(') {
currDepth++;
} else if (s[i] == ')') {
currDepth--;
minDepth = min(minDepth, currDepth);
}
}
return s.substr(minDepth, s.size() - 2 * minDepth);
}
Solution in Java :
import java.util.*;
class Solution {
public String solve(String s) {
int A[] = new int[s.length()];
Stack<Integer> stack = new Stack<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (c == '(') {
stack.push(i);
} else if (c == ')') {
int match = stack.pop();
A[i] = match;
}
}
int i = 0, j = s.length() - 1;
while (s.charAt(i) == '(' && s.charAt(j) == ')' && A[j] == i) {
i++;
j--;
}
return s.substring(i, j + 1);
}
}
Solution in Python :
class Solution:
def solve(self, s):
"""
(((abc)))
123 321
(((abc)))(d)
123 3211 1
"""
N = len(s)
open_map = defaultdict(list)
closed_map = defaultdict(list)
curr_count = 0
for idx, ch in enumerate(s):
if ch == "(":
curr_count += 1
open_map[curr_count].append(idx)
elif ch == ")":
closed_map[curr_count].append(idx)
curr_count -= 1
if not open_map:
return s
to_remove = set()
"""
The below code starts verifying the saved indices in the hash_maps
"""
i = 0
j = N - 1
for open_ct in open_map:
curr_open_arr = open_map[open_ct]
curr_closed_arr = closed_map[open_ct]
"""
The below code checks if There's only one open/closed brace and whether those braces have appeared at the ends (0, N -1), (1, N - 2), (2, N - 3) ---
"""
if len(curr_open_arr) == 1 and curr_open_arr[0] == i and curr_closed_arr[0] == j:
to_remove.add(curr_open_arr[0])
to_remove.add(curr_closed_arr[0])
i += 1
j -= 1
else:
"""
If any of those are not valid, then the string is not enclosed
"""
break
if len(to_remove) == 0:
return s
new_s = []
for idx, ch in enumerate(s):
if idx in to_remove:
continue
new_s.append(ch)
return "".join(new_s)
View More Similar Problems
Super Maximum Cost Queries
Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and
View Solution →Contacts
We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co
View Solution →No Prefix Set
There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio
View Solution →Cube Summation
You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor
View Solution →Direct Connections
Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do
View Solution →Subsequence Weighting
A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =
View Solution →