CT30371

Last letters of Urmila

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

It is audit day at the tulip beds of Bloomhaven. Urmila spreads the letters records across the table and picks up a sharp pencil. 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| <= 30913; characters are '(' and ')'.

Example 1:

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

Example 2:

Input: ()()()(((()()))))(()))(()(())()))))()((()()(())()(()())(()()()()))()())()((((()))(()(()((()()()(()()))))(((()(((()))())))())())((()()()(((((()))())((((()(()))(()))((()))()))()((()())))())((()))())(()((()))))(((()()))))((()(()))())()(())))((((((()))((()(())()())))())())(()((())())(()))()()()(())()(())()))()(()()()((()()))))((())))))()()(()(())()(())())()()()()()()(((()())())(((())(()())()()(())())))()((())(()(()))()()))))()((())(()())))))()()()((((((((((()()(()))()))(((((((((()((())((())())))))))(()())()(()))))()((()())())()))))(()())((()(()))())(()((())())(()((((((())()(())()()((((()()((()))))((()))(((())(())(()(((()()))())()(()((((()))(()))()(((())(()))(()((((()()()))()(()))))(()))()()(((()())((((((()())()))())())(()))())())((()))(()((((((((()())))()))()()))))()()(((())))()()())()((()(())…
Output: 86

Example 3:

Input: )))))()()())()())))))())((()(((())(())))()()))(()))(()))())(()))(()(((())()()()())((()(((())((()())))))()(((((()((()))())))))((((((((((())((())(((((((()(((())))))))))))())))()))()()())()(())))(((()(()(()())()((((())((()(((((()()((())(()((()))((()())))))()(((()()(()()(()()((()(((((()(()((((()(())))(((((((())()(())(()(((())())(()))))()()()((())())()(()()((()((())((((())))((((())()))())((()(())()((((((()()()))(((((()())))((((())))())(()(()()))()()))())(()))()))()())()(((((()())(()()())()((())()())(((()())(()()()())())))())()()()()(((())((((()())(())))()())()(()()(()(()())())))())((()()()(()))()))())()())((())()))())))))(()()(())()())()())))((())(()((()((()()(((())())()())((())))((()())))))())((()(((()()(((()))()(()())()(()))()())()(()))))())(()))(()()()(())()(())(((())()((()())()(((()(())))))…
Output: 265

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Last letters of Urmila - MEDIUM Coding Problem | CodeTikki