DSA Level 2 Data Structures Stacks Minimum Add To Make Parentheses Valid

Minimum Add To Make Parentheses Valid

medium

1: Given a string S of '(' and ')' parentheses.
2: You need to find count of minimum number of parentheses '(' or ')' when added in any positions so that the resulting parentheses string is valid.

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

1: S.length &lt;= 1000
2: S only consists of '(' and ')' characters.

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

()))((

Output

Design A Stack With Increment Operation

Score Of Parentheses

Related Questions

medium Next Greater Element To The Right easy Next Greater Element I easy Next Greater Element Ii medium Validate Stack Sequences medium Design A Stack With Increment Operation medium Score Of Parentheses medium Reverse Substrings Between Each Pair Of Parentheses medium Minimum Remove To Make Valid Parentheses medium Online Stock Span medium Exclusive Time Of Functions medium 132 Pattern medium Remove K Digits medium Asteroid Collision medium Remove Duplicate Letters hard Largest Area Histogram 2 hard Maximal Rectangle