CT26943

Jeweler's Bracket Repair Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The clerk Jeweler has been asked to plan the beacon maintenance rota. On the desk lies a long table of ribbons readings. 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| <= 552; characters are '(' and ')'.

Example 1:

Input: ))))())(((()((((((()()))))))(())(())))()(()(
Output: 8

Example 2:

Input: ((()((()()))))(()))())())())())()))()))(()(()((()(())))))()))(()(()((()))()()((()))()())())))())()))((()(
Output: 19

Example 3:

Input: ()())()()()(()()))(())(((((()()()))()))((()))))(((()()(()((()(((()))(()()))()))((()))))))))()(((((((())(()())))()()())())))((((()))())((())()()()())()())())()()))()())))()(()(()()()())((())(()()))))))()())))((()(())(((((((())(((((()(())((((()))))()))()))()())(())())(()((())(())(()())(()((((()(()((()(())()()((())()()())(())))))()())()())()(())))((()()()(()(()()))(()))())))((()((((()()(())))(((())(()())(()()()))))(()()(()))())))(((())())(()((()))))((((())(((())((()
Output: 31

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.