CT34729

The scrolls Bracket Repair Puzzle

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Before the gates of the lakeside town of Mirrormere close for winter, Lata must finish the scrolls ledger - one figure at a time. 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| <= 33857; characters are '(' and ')'.

Example 1:

Input: )((())))))))((()()(())()()())))((((((()((()))())))()()((()(()()())))(())()(())()(()))(()(())())()((((((())())()()()()()(()((((()))(())))())))(()))(())()()((()))()())())))(((()(()))())())))((())((()()))())))()(())()(((()((((()((((()(())((((()()(()()((()()()()))(()()(((())(((()))()((())((()))())(()))((())())))()))()()))))(()()()(()()(()(((()()(((()()((((())(()((())()((((()))(()()((())()()())(()))())((()()(()())()()((()(()((((()(()()))))(())())(()()()((()))()()))))((()())()))(())()))))))))(())()((()((((((((()())())()()(()))))())()((((((()((()())))())((()()(()((())()))(())(()(()(()(((())()())(())()(()((()))()))))(()())(()((()(()())(()()()((()))(((())()()))((()(())(())(((())))(((()))()((())()()(((((())()(()))())()()))())(()()())())((())()))()((((()(()(((()(()))))((()(())()))(()()((((((((())((()…
Output: 111

Example 2:

Input: (())))())))))()()()))()(()())((()(())()())()(()())(((()((()(()))((()))())(()()(()())()))((()))))))))))()()))((((()(((())(((()())()())))())((()())((()()(((((()))())((())()(((())()(()))))))))(((())()))(()()))()(()))(())(((((())))(((())())()()()(())))(((()(((((()((()(())()(()))(()())())(())()())()))(()()))()())()(()(())()))))((((()))(())(()()((()(())(((((((()((()()(((()(()((()()))((())())))()(((())()(()))(())()))()(()((((())(((((()))(())(())))()))()))((((()))(()(((()()))(()())()())()())(())((((()((()))(()))()())()((()()(()))(())))((()())((()()))(()()()))(()())))))((()())))))()(()))(())(()))(()((((()(())()(())())()))((()))(()))((()(())()())((()())())(())((())()(()(())))))())))((()(()))(((()(()())(()()(())(((()()((())))))((()()))))))(()(()()(())((()())((()()())())())(()))((()(()((())))()(()))()…
Output: 360

Example 3:

Input: ))()()()()())(())))(()(((()()((((((()()())())(())()))))(()(((()(()))(())))))(()(()(((()))()(())()(()))())))((()))((())(())())()()((()()(())))(()())))())()))))))()(()()()()))))(((()((((((()))))(((())()))()()()))))())(()()))(()(((())()))()))()(((((())()(())(()((()))())(()((()((())())())((()((((((()()((((((((())()))()))())))()))(())))())()))))()((()()((())()()((()))))))()(()))()))))()(()(()((()()(())(())))))()))(())())()(()))))((((()(()))))()((((((()))))((()(()()(((())))))))()())()()((())()()(((())))))(()(())()()(((((()))(((((()(((()((()()())(()()))(())((()((()))))((())()())))))()(()()()))()()))(()()))((())()())())(()(())))()))(()((()((()))()())))))))(()(()(())())(((((())(((()()()()(())(())))(((()(((()()()(()))))())(()()((()()()())))()(((()())))()(()()(())()()())()(()()))))()))))()(()))((())(…
Output: 178

Constraints:

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

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