CT33679

The Secret ribbons of Fiora

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Morning light hits the coral atoll of Pearldeep as Fiora unrolls the day's manifest of ribbons. The tally will decide the next shipment. 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| <= 52103; characters are '(' and ')'.

Example 1:

Input: )()))((()(((((((()))()(((()(())))()))()(())(((((()((()(()(())))()((()))))))()()))(((())(())()())())())()((()))((((()((((())(((())((((()()((()())))()()))())((((()))())()((((()))))))))))())))(()()))))())((()))((()()(())))())()()))(()((()))))((()((()()()()(()))((()()))))(())()((()())(((())((())(()())()(((()((((()(()((((())((())(())((()()())((())(((()(()(((()))())()()))())())(((()((()))())()((()()(()))))()(()())())(())(()))(())()(()((((())))(()((()(())((()()))))((())((()((())()(((()(()())()(()))()()()()((((()))))((((())()()(()(()))(())(()()(()))())))))((())))(()())))()()))((()(((()())))(()))()((()(()))(()(()(((())))))))))))(((((((())())((()(()(()(())()()()(())))(()((((()))(()))()))))(()())(((()()()()(()))())()()))(())))())())))))())()))()(()())()))))))()()))()(((()())))((()))())(((((())(()())(…
Output: 188

Example 2:

Input: ((((()()()()((((((()(()((((((()())))()))()()((((())()((()(())()((())()))(()()))(())(()))(())((())(()()())())()))())((()((()()(((())()(())(((())()()))((()))()((()))((()())()())((()))(()))((())(())((()()())()())((()))((()(()(()(()))()))))))(()(()))(()()()()))()((())))()())()()((((((()()(()())(())(((()(())(((((((((((()))))))((()(())((()())))(()()))))()))()())((()))((()())())()(()(()(())(())())))((((())()())()))((((()()())())((((())()(())))()())(((()()()))()))(())()(()))((()(())(()()(())))()()())(((((()))(()(()()()())())(())(()))()))(()))()))))((()))(())())()()(()(((()))(()(()(())())((()()()))(((()))(())()()((())()()((()((()))(())))((())(((()())())()(()()()(()()()))((())(()))))))())(((()((()))()())((((()(())))()))(())))))()(()))())(()((())))()())()))())(((((())))))))()))())((((()(()())()))))))…
Output: 320

Example 3:

Input: ())))((()())((()))()())))))()())))()((())()((((((((())()()))))()(((())))((())()()((())))((((((()((()())((()(()(()))())((((()))((())))())(())()())))()))))()()()(((((()))()((())()()())))(()()))()()))((((())))(()()()()(((()(()(())(())))(()))))(())((()(()))())(((()))())((((()))(()))))()(()(((((((()))((((()(())))()(((((()()()())())()((())())((()()))))(()))()))())()((())(())))))(())(()(())(())(()())()((((()(())())()))(()))()))(()))(()))))(((((()))))())())((((((())()))))())())((()))((()))(((()((()((()(()()(((()()()())()()(()))((())(((())(((()()()))(())))((((()))((()()(()(()(()())(((()()())())(())(())(())(())()(((((()))))))(())))(())((())())(())()(()())()(((())(()(()))()))))(())))(()))()((()))()((()())(((())(((((()))())))))))((())(())))(()((((())())((()()()(((())()()()(()))))(((()()((((()(((((())(…
Output: 300

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Secret ribbons of Fiora - MEDIUM Coding Problem | CodeTikki