CT32661

Kian Counts the sigils

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Kian found an old ledger of sigils in the loom house attic at the northern keep of Frostgate. The margin notes pose a precise question. 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| <= 39320; characters are '(' and ')'.

Example 1:

Input: ))())((())(()(()()()))()))((()((()((()())(())(((())))()())))(()()))()())))()()(()((()(())()))((())(()()()))))()))())))))(()(((())((((((())(())))(((((()(()))())))())())(())())(((())((((())()()()(((()(()))(()())((()()())())((())))))()()()((((()))))())(()(((())))))))()))))()(())(())())()()())))()))))()))())()(((()()()(()())(())(()))))))())((()((())(())))((()))()))()()(()()()))((()((((()))))(())((()()()((())(()())()()((()(()(())((()()(((()(()))()(((())))()((()))()()))(((((()))()(()((((()())))()((())()(()(()))(()()((((()))))())()))())()((((()(((())()))(((()(())((()(((()()(()()())()()))())()(()))(((((()((()()()()))))))((()(((((((())))))(((()))(()(())()))(()()()(())((())(()(((()(()))()()(()))()())(()((((()())((())()(())(()())((()))())())))((((())()(())((()))((()(((()()()()())(((((((()())((()())))…
Output: 283

Example 2:

Input: (((((((())))))(()(((((((((()(()(()))())))((((()(()()())))())(()(()()()(((((()(()((())((()))))((())))(()((())()())())())))))(())(()())(()()(((()(())((()())(()()))(()(((())))()(()))(()())()())))()((((((())(()()(((()())(())()(((((()((()())))())(((()(())())())(()())((())))()())())()(())()(())((((()((()())((((())((((()()))())((())))))(()()())))))()((())(()()))))(()()()(()(((()(()()())))(()((()(())())()(())))((((()))((()((())()))((())((()((()((())()((())))(()((())()((())((()()))(()))(((((()()((())))((())(((()())())))(())((()()))()(((()())(()(((())((()))(((())((()((((()())((()())()()())(((())))))))()((())(()))()()((((()))))))))())))(()))))())())())()()(()(((()((()())(((((())(()))((((()()(((()())(()())())))()))))(()()))))))()())())(())(((())((()(()()(()))(()()))()))((()()))(())))))())())))))()()))…
Output: 145

Example 3:

Input: ()))(()()))))()(((()(((()(()((()))()()))(()))())))())))((()((())))))))(((()()()((()()(()(())()()()(())())())(()))))))))))))()()())((()())())(((())))())()((())))(()))()))()))))(())())))()((()()())))(((()(((())(()((()()()))(()())()((()))())(()(()))(()(())))(()()()(()))(()())))()()())))()(((((()((((()))((()(()())))))()((((()((((())))()(())()(())()()()()(()(((())()()((((())))()(()))))(())()(()()())((())))))()))()((()(()(()))())))((()(()()(((())))))())(())()()())(()()(((()))))()))((())))())))()(())(())()()(()))(()(())()(((())(((()()))())()))(()))())((()()))))())()(())())())((()))())((((()()()(()((()(((()((()()((((()()))(((((())()))())((((()(())()((((()()()(()(()())(()(()()))(()))())))))((((())())((()(()()()))())))))())))()())))))))()(()((())))(((()))())(()())()())()((()())))((()())(((()((((((()…
Output: 212

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Kian Counts the sigils - MEDIUM Coding Problem | CodeTikki