CT30489

Shepherd's inscriptions Bracket Repair

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

At the port of Emberfall, Shepherd records each inscriptions in a worn leather ledger. The guild wants answers, not guesses. 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| <= 31253; characters are '(' and ')'.

Example 1:

Input: ((())()(()))(())))(((((((()())()(()))))())))))())))))))))(()))()(())(()()(()((()(()()))())()((()(())(((()())()))())()))))(()((()()(()((())(()(())))()))()))())))(()()(())))((())((()()))()((()()(()(())())()())))(((()()))()))()))()))((()())(()(()()(()))()(()(((())())))((())((((()(()(((())())))(()((()))())()))((((()()))()))(()()()()((((())())()((()(()(()()()))((())))))((())()()()((()))((())(()((())))()())(()))))))(()(((((((((())))())(()((((()(((((())))(()())((())))))(())))(())(()))()())))((()()((((())(()((())()((((((())())))()())()()(()()(((())()()()))(()())(((()()(((((()((((((()(()()()())()())())))())()()))())()())()())())))((((()))())((()))))(())(((())()(())()))(())()())((((()(((()(()())()))())))))))((()))))((((()))))))()(((((((()())()(((()()()((((()(((()()()(()))()((()))(()))(()((((())((()(…
Output: 107

Example 2:

Input: (()((()(()))(())()()()())))((())))))(((((()())(((((())((())()()(((())()())))))()()(()))))()()(((()))(((()))())))(())(()()((())()((()))(((())))()))(())()((()(()((()))((()))(()(()(((((()()())()((()())())(())(())(()()(((((((()))((())()((()))()))())()()()(()()))()()(()()())()(())((()))))(())))()(()))(()))))(()((()))))))(()())))(()(())())((()))))(()((()))((()())()))(((()()((((()((()(((()(((((()))(()))()))(()()(()()(((()(()()()(((()()()(()(())(()(())())())))()())(((((()())())((((()(()((((()(()))()))((())))())()))))))(((()))))))((())))))))))(())()()()(())()()))()(()(()))())()))())()))())(()()())())(()(()())((()))()((()((())((())(()))()(()()(()(((((((((()))()()))()())))()))(((())())(()(((()(((())(()(()))()()(()()()())())(()))))()(())())((())(()))(())(((()))(())())())(())()((()((()())(()((())))((()…
Output: 184

Example 3:

Input: )()())))()))()(((()())()((()((((()))))(()()((()((()(()))(()()())))))(())()))(())()())()()(()((((()(()())(((()((()))))(((((()())(()()))())((()()(()()())))())()))))()(()(()())())((())))(()(()()))(())))))())))()))(()())))())))(((()((()(()))((()())(((()))))))))()()(())()(((()(()(()()((((()((()()()()))(()())()()((()))()((())))((()(((()((())(((()()((()()()))((((()()(()(()(()()(()(((())())()(())(()))))())()()()((()))())(((()))()())())()()((((())))))())()))())()())))()()((())(())((()())())))(((()))()()()((((())))()))())())()()())))()(()((())(())(())))()((((())(((()))()()))()(()()(())(())()()()))((((()((()(())))())(()()()()))((()())())))((((()())(((((()))(())((()())((()))((()))((()(())))(())))()((())())((((())())(()(()))(((()(())))((()(()))()()))(()(())(()())(())())))))((()())()()))((((((()()((()))…
Output: 165

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Shepherd's inscriptions Bracket Repair - MEDIUM Coding Problem | CodeTikki