CT31181

Zane's banners Reckoning

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Caravans arrive at the coastal hub of Tidewater with crates of banners, and Zane the accountant must account for every last one. 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| <= 52838; characters are '(' and ')'.

Example 1:

Input: (((((())((())()(())()())))(())(((()((()((())()))))()))(((())(((()))()())()))(())())))))(((((()()(()))()())))())(()())()(()(((()(((()(()()()))()()())(()())()))))(()(()(())()))))()))()((()))(()))())(((()))))()(()))())())()()(()(())(()()()))()()))())()())()()()))(())((((((((())))((())(()()()()(((((())))(()())(((())((()))()()()()()())()()(())((()))(((((())))((())(()))()()))(())))(())))((()(()()()()(((()(()()))(()(()))())()()())))))))((())(()()))))(())())))())()(((()()(()((()()(())))(()((()()))(((()()()()(()()))((((())())(()))))))(())(((()()()()(((()((())()()(((()))))()))))())))())))((()(()())(()())()))(()))(((())()))()))((()(((()((()(((())((()))()))(((((((((()((()()((()))(((((()()()())(()))))(((())()))(()()))())((()))))))(()(())(((())(()()(())()()())()())()))(()(()((())(()(((()()))(()()((()))(…
Output: 307

Example 2:

Input: ()())((()((())))(((()))))))((())(((((()))())()()((()))()))(())))((((())()())))(()))()))())(()(((((((())())((()((()()()))(((((()())((()))(())())))()))()))))())()))(()()(()(((()())()))()(())(((()(()))((()))())))()(())))())(()(()()((()((())()()((())))))((())(((((((((()(()))((()))()(((())))((()))((()()())()(((()))))()))(()())()()))(())(((((()()())(())()()()))((((((()((()())()()())())(((())(((((()()(((()))()())()))()(())(()()))()((((()))))((()()()))(()()()(()(((()()())()()(()()((()()())())()))(((((()(()(()(((()(()(()()))()()()(()((()())(()))))))())))()()(((()()(()))))()(((())))))())))()())((((())))))(())(()))))()((((())(((())()()((())())((()(())))())((())(((())))()()(()))()((()))((()(((()((()(()())(()(()(()((())(()(((()())))(())))(((()))())()()))()()))))()(()))())()(()())(())((((((()))))(())(((…
Output: 291

Example 3:

Input: ((()))))()()((()(()())()()(()(((())())()()()())))((((((()(()))(((((())(())((()((()))())))()())))(()()((()))()(()()()((((())))())((((()(((()))()()()((()((((((((())(()((())))(()(((()))()))((()()((()(()())))(((()()(((())(((()))))((()())()))()(((()())(())((()((()))(((()(()))((())))((())((((())))()))())(())()((()))())))())())()())())())(()))))))())(())()))(())()((((()(()(()))((((()()()))()))()(()())()())())))(()(((()))()(((())()()())((()()))())(()))())(((())))()()())))))((()()())))(())))(())()))()))))()()((())((()(())())(((()()(())())()()()())()))(())()(()))()()()(()))((())))(((((()((())()((()(()))()()()())(()()((())())())(()((((()((()(()((()((()(())))))(())))()((()((()))()))())())()))(()((()())((())(()((((())())())()()))((((()()((()(()()(()())))))()))()(()))(())()((((())(((((((()()(())()(()(()…
Output: 241

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Zane's banners Reckoning - MEDIUM Coding Problem | CodeTikki