  Learn Tech Skills from Scratch @ Scaler EDGE # Minimum Parantheses!

Problem Description

Given a string A of parantheses ‘(‘ or ‘)’.

The task is to find minimum number of parentheses ‘(‘ or ‘)’ (at any positions) we must add to make the resulting parentheses string valid.

An string is valid if:

• Open brackets must be closed by the corresponding closing bracket.
• Open brackets must be closed in the correct order.

Problem Constraints

1 <= |A| <= 105

A[i] = '(' or A[i] = ')'

Input Format

First and only argument is an string A.

Output Format

Return a single integer denoting the minimumnumber of parentheses ‘(‘ or ‘)’ (at any positions) we must add in A to make the resulting parentheses string valid.

Example Input

Input 1:

``` A = "())"
```

Input 2:

``` A = "((("
```

Example Output

Output 1:

``` 1
```

Output 2:

``` 3
```

Example Explanation

Explanation 1:

``` One '(' is required at beginning.
```

Explanation 2:

``` Three ')' is required at end.
```

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details. Hints
• Hint 1
• Solution Approach
• Complete Solution