CT22056

The Bracket Repair Beneath Rye Hollow

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

At the gristmill of Rye Hollow, Jace records each labels 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| <= 1852; characters are '(' and ')'.

Example 1:

Input: (()(((())()))())((()))())(((()))(())(()(()))))))())((((()((()(()))()(())())()())()(()((())())()))()((()()((())()(()(()))(()(()((()()()))(()(()()((()))))))((((()())()()()(()())())())())((((((()))))()()))(())(((((())())()((()()(())())))(((((((())()((()))(()))(((())()(())))()((())()(())()()(((()((())))))()(())()(()))((())((()))))(()(())()((((())()()(()((()(())))())))()(()(()(()((())))())((()))())())))((()(((()))())()()))((()((((()))))()(()(())))((())()))))((())()))())((())))()))()((())((()))()))()())(()))())(()()(()()(())))(())())())))))))((()(()((())))((()(()))((((())()))())((())))()(((()()))((()())))))()()((()()(((()((())(()))((()(((())(((((((()()()()()()((())())(())())((()((())))(())(((()((()((((()(((
Output: 42

Example 2:

Input: ()()))()))))))(((()(()))()(()(()()))))))()(()))()))))))((())()()(()())))()(())()(()))())()())()())()())(()((())((()((()(()()))((()))))(())(())()))))()((((()((()((((((())()())()()()()())(()()))(()())(((((((())())))()))))))))))((((())(()))())(())()(()(()()(())((()))((()(())(((())(()()((()))()))()()))(((()(()()(())()(((((())((()(()))()))))()))(()())(()(()((()()()((()))((((()(((())))()()))(()(()())((()))((()()()))(()(())))))(()(((()((())((((()()())((())))))()()(()()))()))()(()(()))()))()(()(()()(()(()())()(())))(((()))())))()()(()(((()(()((()))()())))()())))))((()(()))(()))(())(())((()((((()()())())(()()(((())()(()()()((()()())))())()()()(((())())))))(((())))(()())()((())())))))((()((())()((((()))((((())(((()))())((()(()(((((()))(())((()())))(()))(())()))())()(()))(()())((())(())())((())))((()…
Output: 51

Example 3:

Input: (())))((()))(((())))()))))()(())()))))()()))()((((((()))(()()(()))()()))())(()()((()))))))(((()((()()((()))))((()(((()))())))())))((()()((((()())))())))()(()))()((())))))())())()()))()())())((()))(())())))()(())(()()()()(((()))(()))())(()())(((((((()()))))()()))()())((()())(())(((()())(()()()))()))))))((()(((((()))()()((())))()))()()()(())()()))))))((())))))()))))))())))()(()()()))((())))((()(((
Output: 54

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Bracket Repair Beneath Rye Hollow - EASY Coding Problem | CodeTikki