CT27057

Ysolde's Bracket Repair Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The store warden Ysolde has been asked to rebuild the damaged itinerary. On the desk lies a long table of banners 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| <= 889; characters are '(' and ')'.

Example 1:

Input: ()((()))((()()()()((((((()((((()()))()))((()()(())())(((())(()))))()()())))(((())))())((()())()(((()(()(((())))))(())(()))(((()))))))((()((()(()((()))))))))(()(((()())(()))))(()(())))))()((()(()))()(((()()((())))()()()(())))()((()))))()())()(((()(((((())(()(((()(())())(()))(()))())(((((()()))(()))())))()(((()((((((((()()(()(()()(()((()(()()))()()))))))))(
Output: 17

Example 2:

Input: ())())
Output: 2

Example 3:

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

Constraints:

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

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