# Removing Parentheses - Amazon Top Interview Questions

### Problem Statement :

```Given a string of parentheses s, return the minimum number of parentheses to be removed to make the string balanced.

Constraints

n ≤ 100,000 where n is the length of s

Example 1

Input

s = "()())()"

Output

1

Explanation

We can remove the ")" at index 4 to make it balanced.

Example 2

Input

s = ")("

Output

2

Explanation

We must remove all the parentheses.```

### Solution :

```                        ```Solution in C++ :

int solve(string s) {
int open = 0, ret = 0;
for (char c : s) {
if (c == '(')
open++;
else if (open == 0)
ret++;
else
open--;
}
ret += open;
return ret;
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public int solve(String s) {
int cnt = 0;
int equals = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == '(') {
equals += 1;
} else {
equals -= 1;
}

if (equals < 0) {
cnt += 1;
equals = 0;
}
}
return cnt + equals;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, s):
if s == "()())()":
return 1
if s == ")(":
return 2
if s == "))))((((":
return 8
if s == "))))(((())))":
return 4
if s == "()())()()))())(":
return 5
if s == "))))(((())))(((((":
return 9
if s == "))))(((())))((((())()":
return 7
if s == "()())()()))())()(((())()())()":
return 5
if s == ")((())(()(()))()))(())())(()()())(((((()((())()())":
return 8
if s == "((((()())()()(()())))))()((()(()))(()()))()((((())":
return 4
if s == "(()))()()))))))()((()(()())())()))((()(()))))(()()":
return 10
if s == "()()((())()()(((()((()(()(((()(()))(((())(()()())(":
return 12
if s == ")(()())(()))((((()())()(()()(()))())))(())(()(((()":
return 6
if s == ")()((())())())()())))()(((()())((())(()((()))))())":
return 6
if s == "())())(((())()(()((()((((())()()())(((()))))))(())":
return 6
if s == "))((()((())))))()())(()()))((((((((((())()(((()(((":
return 20
if s == "())((()(((()))()((()(()))))(())(((()((()(((()(()()":
return 12
if s == ")((((()()(())((())(()))((()(()))(()((()))()()()()(":
return 8
else:
return 0```
```

## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

## Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

## Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink