CT28715

Theo and the Lazy sigils

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

In the kelp forests of Tangledeep, Theo the measurer keeps careful count of the sigils. Approve the repair estimates, 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| <= 555; characters are '(' and ')'.

Example 1:

Input: ))((())(((()()()(((()()))())())()())()(()(())((())()))(())))())()((()(()())))((()(())))))(()((()())((())))(((()))))(((()))()(()((((())()()())(())((((((()())))(((())))())())))()((()))(()))(()))()))((()())))()()((())())(())())(()(()))))()
Output: 10

Example 2:

Input: (())(())())()())))())))()(()))()(()(()()))()()()((((())(()()))((())))(()())())(()()))(())()())))))())((()(()((())))()()))()()()()))))(()()()((()()((()((())()((()()(()(((((())())()(()()()))(()()()))())(()())())(()(()(()()((()(
Output: 33

Example 3:

Input: )()))))))(((())())())()((())))(())))((()((()))()()()()()))))()((())))(()()((()()()()))()())(()((()(((((()))))()))))()))))())())()))((((())))()))()()))()()(())())))()((()()))()(((()())(()()))))())((())))))())))(((((()((()()()()))())((()()()((()((()()((())((()()((()())()())(((((((())))())()((()()(()()()))((((()))))()()))(()()()(()((()))())(((()())))))(()(((()())())()))()))(())))()()))(((()))((()())()()))()((()((((()())((()()(((()(()()))(())))(((()((()()(()()()()))((((()()))))()))))))))))((())(((((()()(())()))())((()
Output: 49

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Theo and the Lazy sigils - EASY Coding Problem | CodeTikki