CT29830

Teal charms Bracket Repair

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Ranger the chronicler watches over the peat bogs of Mossgrieve's stores of charms. A careful computation stands between order and chaos. 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| <= 36156; characters are '(' and ')'.

Example 1:

Input: )(())(()()()(()(()()())(((())()())())(()(()))(()()()))())()(()()()(()((()(()()(()())())))(((((()(())()((((()()))())(((()(((())))())(((((((((()(()(((()(()((())(()))()(((((()(()())()))((()(()((()(())((()())((()())()(((((((())()()()))()(())(()())()())()))(((()))((())(())()())))((())))(()(())(((()))))))))()(()()())))))()())()))(()()(()()((()())))())))((((()))))))())(())))())())(()()()()))((()))()()((()()()))()())))))()()()())(()))()))()()(()())()))()(()(()())(()((((((()((((())())()(())()()()))(((((()))((()(())()(((((()())())())(((()((()((())))((()(((()())()()()()())(()((()))))))()()()()))))))(())())()()((())()()(()())()())()))())(((()))(((()()((((()))))))))())))))))())))()))())(()(()))))(())((((((()))))((())()(()()(()(()(()())(()(())())())())(((())))))((()()))()())(())))()))()(()())))()))()()(…
Output: 155

Example 2:

Input: ()()((()))))()())()))(()((()))((((((()((((())(()()))))()))(()))(((())((())())(()((()()))))()())()))()))))(()))))()(()))(()(())))))((()(())(((((())))(())))()((())))(((()))(((()(()))(())((((()()())(()))()((()))))())(())((()()))()(())))))()(()()(((()())))))()()()))()(((()()(())()()))))))(())(()())(())))()(())(()))(())((()()))))((())(()))()())((((((()())))())((()((()(()(())())(())(((())())()()((()())())(()))))())(((()()(((()((()(()))(())(()(()(()())()((((()())()()()(()))))((())(())))(()())()()())))()))))()())((())(((()()))(()((()))))()())))((())()(())())(((()()((((()((())))(()()()()())))(()((())))())))()())((()()))()))(((()))))((()())))()()(()))(()))()()()((())())(()()(()((())(()()()((()((()()(()))(()))()))()(((((()(()((()())))))(()()(()((()((())()(()(()((((())(()()()))()(()()(())(()())()((())…
Output: 285

Example 3:

Input: ()))))())()(()())))()))(()()))(())))((()()))())))(((((())((((())))))()()()))((((((()(((()(())()))())()))))()((()())())))(((())((()()))())()))))((())(()()))((()()(()))))))(()(()()()))()()()))(()(()(()))())))((()))(()()()())()()((())()(())())))))(((()())))())))))))(())()(((())())())))(()(()((((()())(()()()))())))))))((()()()(((()))((()())(((()))(()()(()(())()())(((()(())())))()(())))()((()))))((())())()(())))())())(()(())()(()))((()))())))()(()()()()(())(((())))(())()(((((((()(((()()())(()()(()()((((()((((((((()((()(()(()))())())))((((()((((((()))))(())))))))(()((((()))))))((((())(()(()))()()(())))())((((())))()))))((((()(()((()(((()((()())(()()())(((()))(())))()(())())((())()())())()))(()(()()))))((((()()(((((((((((())))()((((())()))(()))))()))((()(()))(()(()()))))))(()(())()())))))((()()((…
Output: 252

Constraints:

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

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