CT31735

Morgana Counts the inscriptions

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Morgana inherited the mint at the coastal hub of Tidewater along with its curious bookkeeping system for inscriptions. 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| <= 49909; characters are '(' and ')'.

Example 1:

Input: ())()))()(((()()()(((()()((()())()(())(((()((((((()()()))))))(()((((()(())))))((()()))()())()())))()())(())()))))))()()))((()))()(()(())((())))(()(((()(()))())())()()()(())(()()()()()()))())())(())()(((())()()))()())(())(((((((((((()((())))))))))()(()(()()))))((()()()())((((())(((((()))(()())((((()))))(()())))())))))((((()))()()))()()())()()))(((())())(()(()))))())()(()))()())((()()))))(()()((())((()((((((()()))(())()(()((())()()))((((())(()((()()(())(())))()()))()))())((())))())(()()()())()((()()(()())((((((()(()()()))))(()())())((()())()(((()()(((())())((())((()()))(()()(((()(((()()()()())))())(())())()(())))((((()((()(()())(()(()()(((((()(((((((()(())(()()(()()))))((()(()(())(())((()()))))))())(()(()()((((())))()())))))(()(())))((()((())(()(()())))()()(())(()())()(()()))(()((()())()(())…
Output: 83

Example 2:

Input: ()(()())())()()))(()(()())((((()))()((((()))())())()((())(()(())()))((()(())(())()()((())(()())()(()))))(()()((())()(())()()(()))))()))(((()()))(())()))()(()))(())(()(())()((()())(((()))()))())))(()))))(()((())()))()()()()((()())()))(((()((())))((((())))((()())))))()()))))((()))((())()(()())))()()(())((()()))(()((()(())()(()(((()))())()))))(()))(()))())((()))(())())))()()(())))()()((())((())))((()())))((()))))(()(()()()((()())))(((())))()()()())())))(((()())())))(()())(())(()()())))))(()()(())))()))(())))(())((((())))(())(((()()()((()()()())((()())))()))((())(()()))(()))))((((((())()))())(((()()(()()())()((()))))))))()))()())())())))()((()(())()((())())(((()()(((())(()(()()))((((()())())(()()(()))(()(()))(((()(((((((())())()(()()(()))()()())())((())))())()())))())(((((())()()))()()))(()(((…
Output: 81

Example 3:

Input: ()()(()((((((((()(())()(((((()(()(()))(()())(((((((()()((())(()))(()((((()())()((((()(()()))()()()((((()(((())())))()))())))))(()(((()((()())()(((((()))(()(()))(()())(())))))()((((()((((()(((())(()()))((())))))()(())())()(((()))()()())(())(())(())())()())(()(((()((()()())())))())))())(((())((())(())((()()()))((())(())(((((()()(()()()))(()(())))())())(((()()())(())(()()(()))))()))(((()((())((())())())))(())((())()()((()())())(()()))())((()((())(((((((((())()()()(()())))))()))(()())))()(((()()()(((()))(()()((((()(((()(((((())))(((()))(())()))(((()())))()())))(()((()(())()))())()))()()()))))))()()))()(()())((())(()())))(())(()()(()())))(((((()()()((((()))()()())))))(())()())((())))()())(()((()((()))(((())))((()(()))()(((()()()())()()(()()(())))())((())))())()()(()())))(())())())))((()((())(((…
Output: 95

Constraints:

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

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