CT22684

The Bracket Repair at Whitewick

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

In the cotton rows of Whitewick, Seth the assayer keeps careful count of the riddles. Inspect the delivered goods, every figure matters. 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| <= 595; characters are '(' and ')'.

Example 1:

Input: ((()())))()))(()()((()))()()())())))((()()(((())())()(()()())))))))))())()())()())((()(()()))())((()))()(()))(()))))()())(()(((()(((())(()())((()())()())))())(())(())))))()()()((((()())))
Output: 21

Example 2:

Input: )()(((())((())(()(((((()((()))((((()(())())))(()))())()))()))()())(((())()(((())((()))(()(())(()(((()()))()))))()()(()()(())))()(()())))()(()((()(()((()()(())((())))()))()()))))()()()()()(()(((())))()))((())))))(()(())(()))((((()))((((())(()()(()()(((()(()()(
Output: 15

Example 3:

Input: )(())(((()())))))))(())))())))))()(()(())())))))()))))()()(()(())))())))(()()()()())))()())(()(())(()(())))()(()())))()(()()((()((()((()())()))(())()(((((
Output: 38

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Bracket Repair at Whitewick - EASY Coding Problem | CodeTikki