CT34324

The Bracket Repair Beneath Scrollkeep

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Legend says the vault under the archive halls of Scrollkeep opens only for a perfect tally of scrolls. Trader means to find out. 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| <= 43788; characters are '(' and ')'.

Example 1:

Input: )())()(((((((()())))()())(())()((()()()(()())((())())()()()))((()))))()(()(()()(((((())))(()(((()()(()(()(()))))(())())((()())(()()(()())()((((((())()(())()()(())(())(((()()()()))()()))(((())()((())((()(()(())))(()(())(()))()()(()(((((()(((())((())((()())))))((()))))))))))
Output: 17

Example 2:

Input: )())((((((((()(()((())))())(()()())())))())(()()())(()())))(())())(((()))())(())))(((((()(((())))))(()))))()(()(()))))(((())()()((((()(()()(((((((())())())())))))((()())()))((()))))))(()))(()((((()()())()()((())))(())(()))(())((((()()(()(((((((()))))))))))()(())))(()()))))((()))((()((()(()(((())))(()(((((((()()(()))()))))))))((((()(()))))(()()(())(()(()(((()))(()())(())()(((()()()()()((()))()(())))(((()((()()()(((((())()()(())((())))(())))))()))())())(())(()))))))()()(())()((())())))()()()))((())()(()())(())()()())()(()(((()((())))()(((()(()((())))(((((())()(())()(()()((()((())()))((((((())()(((()))(()(((()((((()())(())()()))((()(())())(()((((())))()()))(())())(((()())(()))()()()()(()()(()()))())(()())()((()))((()))))()()())))())(((())()))(()(((())()(()()()(()(()()))((())))(())(())(((())((…
Output: 367

Example 3:

Input: (()()))((())()(((()()())))((())())()))()((()()())()()()())())()(()((())()(())()()()((()))))))))()(((()()((()()(((()())(())()))())()((())))()))((()))())))))((((((((()))(((()()))(((()))(()((()()))(()())((()()))((())))()))))()()())))()((()))()))(((())()((((()()()(())(()()())))((()(())(())))))()())((((()(()(()(()())((((())(())))))()()))(())()((())()))(())())()()))()))((((())()((()))(()(()((())((()()))))(())(()()((())))(())))(((()(())()())))()))))()()((()))))((()((()))()(()()))()))(((((()((((()())())(((()()((((())))))(()()()(((()))))())()((()()((()(()))()))()(())(()))(()((()()))))))())()((()(())((()(()))())))())())())(())()(())()(()((()(()((()((()(()())(((((()(((())(()))())))(())(()(()()(()(()())))((()(()())()()))()))))(((()))(())()))())((((())())(()((((())))()())()())))()))))))()(((()())(((()(…
Output: 472

Constraints:

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

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