CT32404

Fletcher's Hidden charms

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

The inventory keeper Fletcher has been asked to forecast next month's demand. On the desk lies a long table of charms 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| <= 32203; characters are '(' and ')'.

Example 1:

Input: ()()))()(()())(()()()(()())))()(()))))))))))(())))(()()))()()((()(()((((())()())(())))()()(()))()((())()(((())()(())((()))()))(()((())))))))()((()(())))(())()))())()())(()(((()()(((((((((((()())))((((((())))))))))(())))()((()(())(())()(())(()(()()((())(())(()()))())(((())())())(()))()()()))((())(((())))(())()(()))())(()(()((())())(())(()((()(()()(())))(())((())()()))()(((((())((()()(((()()((()()((())()()(()))()((((((((((()()((())(())((((((()((())((()())()))((()(())(()()((()))))(()(()))())(())()())()()))(((()(((())())()())(()(()))))())())()(()))))((((((()(()((())()(())((((()()())()))))()()()()))((()())))(()))(())()(((()()))))((((()))()))(((((())()()))(())(((()())))))()(()()))())())()()))(((())((()))))()()(((()((())(((((((((())))))(((()))()())))()()(((()))(())()((()))()()((()((()()))(())(()(…
Output: 82

Example 2:

Input: )((()))())()))()()())))((())(()((()(())))))))()))((()()(((()()(())())))))))()()))(((()))())())(())((())(())))))()()()((())())())(((()(()()((()(())()()((((()()()(()()()))(()())())))()(()((())))()())))(())(()())(()()(((())))))))((((((())((()()()(())))((()))()())))))((()()(())(()))(((()((()((()))()())(((()(()())((()))(())()))())()()))())(((()()(()(((()))(()())()))()()))((((()()((()))())(())())()())(((()(()))((()(()()))))))()())(()((()(()())()()()((()))(((()(()((()()((()))((((()))()((((())(()))(()()()()(((())(()(()(((((()(()()))()((())()))()(()(())))())())))()()(()(((())((()())(()))(())())()))((((())(())))(())(()())))))(((()()))()(((((((()())())())((()()(()()))()()((()))(())())())((()((()(())((()))()))((()((()))))()())))()())))))()(()))())))())()()())()()(((())(((())()()())()))(())()(()())()))…
Output: 34

Example 3:

Input: ((()()(())((((()(()((()()())((())(((((())((()(((()))(()((()(()())())()((())(()(()())())((()()((()))())(()))()))))()())(())()(()()(((()))())())()((((())(((()()()))())())()))()(((((())()))())()()((((()(())((((()(()))))((((())()()()))((())(((()(((()(()(((()()()((())())(((())(())))))()))()))(((())))(()())((())))))()))(((((())((()))()))((()())()(()())(((((())(()(()(())(((()())()))()))((()((((((()()(()(()))()()()())(((())(((((())))()()(()))(())()()))))(()))()))()(()()))(())((()()((((()))())()()))()))(((()()((())))((((((((((())(()(())))()()(()((((())())(()()())()())(())((((()((())((()((()()((())())()()((((())((((((())()()))((()))((())()())((((((()()()())))))(((())((())(()()))((())((())(((((()(())))))(())()((())()))))())))()()))(()())))())))(()()(()()))(((((((()()()())(()(((()(((()(()())))))(()()(…
Output: 180

Constraints:

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

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