CT34056

The Bracket Repair of the Moonlit charms

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Kian inherited the archive at the galleon yard of Masthead along with its curious bookkeeping system for charms. Time to make sense of it. 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| <= 49598; characters are '(' and ')'.

Example 1:

Input: )()(((()())((()))(()()()))()(()))))())(())((()()()(()()(()())()(()(()())((()(((())((())))()((()())())()))))()))())()))(()((()((()()))()))())()()))(((())((((())()(())))))())((((())))))()(((())))())())(())()(((())))))))))())()))))(()()(())(())())(())()(()))()))()(()((())((())())()((()())))(()))(()))()())((()()())((()()))(()(((()))())())())((())(()()))((())((((())(()())()())(()))(())()))))()(((((()))((())))(()))(())))())(())((()((()(((()(()())))()()(()())))((()()())))())(((()())()())())())())(()((((()))()()))(()(()()()())((()(()((()((()(((())(((()()(((((()))(()(()))))(())))()))()))()(()())()))(())(()((()())()((((())()()())(()())(((())(()(()((())()))))())((((((())(())((((((()()))(()())))))))))())()((()))())))()(()())(((()(())()))()))(((())(()))))))((())((()))()(()()))()(()()(((((()((()((())))(…
Output: 631

Example 2:

Input: ()(()()(())))))((()())()(()(())))()()(()(())()(()())(()(()(()((()))))())()((()))()(())(()()())((((((((()()((((()()))(()()(((()))((()()(()()))))))()())()(()()()(()()())(()()())))()())))(())(()()())())()()))((())()))(()(()(((())(())())((()()))())(((()())))()()(())()()((()()()((()())))(()(()()))(()))(()))(()((()()))()()()())))))((()))))(())()(()))(())()())())))))(()(((())))(())))(()(()())()()()((()()((((()))((())((((()()))(())(((()())((()))))(()(()(()))()()()())(()()()))((()()))())(((())()((())()((())((()()))()())((()))()))()))))())(((())(()(())))()())())())())))()())))()()(((()())()))))(()))))()))))())((()()(()()(((()((())))()))(()()))))())((()(())((()()()())))())))()(())((()())()())((()()()((())))(((((())))()())))))(())()())))((()))(((()(()((((()()()(())))((())(()()(()(())))())))()()()))()(…
Output: 150

Example 3:

Input: )(())(((()()((()))(((()(())()()()(((((()())()(()((()((()(()((()()())())))((()))(()()())))))(()()((()))()()()()))(()((((())()))(())()()())))((())(()()()()((((((()(((())((())))))(()(()))()))))()())))))))()())(((((()()(())))(())()())())(()))(())(()(())(())))())(())))(())())())())()(((())()(())))()))()()())())())))())(())()())()))()()()(()))((())(())))()())())))()(()()()))))()(()()()(())))(((()(()()(())())()((()())((()))())()(())((()))()())(()(()(()(((())()((()())())))()))))((((()())(()())())))())))))(((((((((((((()))(()()((((()(()))(((())(())))()(()()(())()(())()()()())())()(())(()((())((()(()()))()))))(()()(()(((())))))))(()(())(((()()((((())))()((()))))(()))))(((((((((((((())()(()((((()))))()(()()((((((())((()()))())(()()()(()())((()(()()((())))()((()(()(()()()))())()))((())((())))((()()(()…
Output: 481

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Bracket Repair of the Moonlit charms - MEDIUM Coding Problem | CodeTikki