CT33188

The Tuskmore Bracket Repair

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Every season at the boar woods of Tuskmore, someone must certify the cargo before shipping. This year the task falls to Admiral, armed only with the inscriptions register. Task: Print the minimum number of parentheses (either kind) that must be inserted to make the sequence balanced. Input format: One line with a string of parentheses. Output format: Print the minimum insertion count. Constraints: 1 <= |s| <= 31594; characters are '(' and ')'.

Example 1:

Input: )(())(())(((())(())())()))))))()))(((()(()())(((((()((((()()(()())())((((((((()))(()()))()(((()))(()())(((())((()))((((())())())))(())(((()))((()))(()(()()())(((()(((())(()()())))()))(()((()()()(()))))((()(((()))())))((((())))())((())(((()))))(((((())()(()()()((((()())()()()(())())))((()()((()))(()(())))(()()((())(((()(()()))((())(())(((((()((((((()((()()()((())()()(()(()(())())()()())()((())()())()()))))())((((()(()())(((()())(()(())(()))((()))())))))()()())()(()())()()(()))()))((()(((())())()((()))))(()(()((()))(())(()()()())))(((()))()))))))()((()()))()()()((())())()))(()))(()(()))))()))()())(((((())()(()))(()))))())()))())())(()((())()((((((())(((()(()))))((())))()((()()((()))))()(()))())())))()((())()(((())))())()(()((()((()())()))()))(((())(()))(((((()))()()((((()(())))()))())))))))(…
Output: 100

Example 2:

Input: )()())((()))))((()()(()(()(())(()))))(()()()()))))))()(()(())))((((()(()(())(()))())(()))))))()))(())))))()())()(((()))))))(())()))())(()(((((())))))((((())(()()(()))()))))())((()((((((()())))())()(()(())())))(())(()(()))((((())())((()()(((()))(())(()())())))))(((((((((()()((())))(()())()))(((())))))())()()(()))))()())()))()(((())())()()())))))(((((())())(((()()())))(()))((())((()(()()())(((()(()(()()(()(()))))((())(()((()(((()())))(())))()()))(())())()()())(()())()(((()())))()(()(((()()(((())))))))((()()()((()))()))))))()(())(()))()(((()(()(((())))))())))((())(()(()((())))((((()()(())))(()()(((())()()()))((())()()())))))(()(((((((()())()()((((()((((()())()))))(()))())(((((())()(((())()())()))()))))(())()()(()()())())(())(((((())((((())((()))()))())))))(()()(()(((((())(())))))()())()(()))(…
Output: 158

Example 3:

Input: ())()()(())((((()))((()(())()(()((((())()((())))))((())()(()))))((()))))())())(()(((())))(())))))()((((()()((((()))))()))()((()))((((())(((()))())))))))))(()))(()))(()())(()))())))(((((()())))())))()()))))((()())(((())))))()()())))())))())())))))))(())))((())((((()()()))())))))))()((((()()((())(((((())(())())()))())()(())((()(()()(()()))()(()))(()()(())))()(()(()(())(()((())))))())())((()())())((((()((())(()(()))()))))(()(()())()((()))(()()((())())(())())))()))()((())()(()((()))))(()((()((())()()()(()))))(((()))))(())))()))()()()))((((()))))())(())())(((((())(())((()())()((()))))))((())())())()()(())()(()(())))())((()))()(()(((()()((()((((()(())))))()())(())()(((()))(())(((())))))))()(())))))(()((()))))))(((()((())(())()())(()()))))((((())())())(())))(())()))))()()))))())))(())())((())()))…
Output: 105

Constraints:

1 <= |s| <= 31594; characters are '(' and ')'.

Loading...
Test Cases:No test cases
No test cases available.
The Tuskmore Bracket Repair - MEDIUM Coding Problem | CodeTikki