CT22296

The Bracket Repair at Obsidian Shore

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Jaya inherited the stall at the basalt cliffs of Obsidian Shore along with its curious bookkeeping system for charms. Time to make sense of it. 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| <= 876; characters are '(' and ')'.

Example 1:

Input: ()(()))))))(()(((((((()()(((())))(((())(((((()(()((())())((((())((())()((())())))(()))(((((())()()((()((())))))))((()())(((())())))()(((())(())()(()))))(())()()())))(())()()())())))))))))))(()(((()(()(((()())((((()(((((())(())))))())(()((((()))())()(())(())(()))()()()((()()())))()((((()())()()(((()))(())())((()())()())(())()(()((()()(()))()(((((()())())()()()(((((((()()(()())())()))()()(((())()()()((()(()((((()))(()))())())())((())()(())(()(()())(()()))()(((())(())(()()())))(()))())))()())(((())((())))((((((())))))(((()((())))))))))())))())(())()()))(()(((
Output: 24

Example 2:

Input: )(()()()(()(((())((()
Output: 7

Example 3:

Input: (()))()(((()(()()()(())((()())()()))()()(((()()(((((()(()()()()))))())()()((()(()()))(())()))))(()())))(()(())(()))())))))))())()()((()()()()()(()())(()(()(()(()())(((((()()))())))))))(()())(())(((()((()()(()((((()((()(()))))(()((()))((()(((()(()())(()()()(()()(()())()()())()())(())(()(())())()(())()))()())))())(()(()(()((((())((((()))(()))()()((()(())(()(()()(())(()((()(()()))()()()()()(()()))()()())())(())(())((()((())))(((())())))))(()())()(()(()(()())((((())))))(()(()()())))(()(((()())())()((((()()()(((())))))((()()(()((((((((()(
Output: 41

Constraints:

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

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