CT22821

Wade's Ledger of scrolls

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The council of the ferry landing of Crosswater pays by the answer, and Wade intends to earn it. First: the full register of scrolls. 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| <= 671; characters are '(' and ')'.

Example 1:

Input: (()(()()()(((()))())))))))()()))((()))((()()))())))()()()))))))))()()()((((()()))((())(())()(()(())((((()(()((()(((()())((()))))()((((((()(((()()()()((())()))(())()((())((()(())()))())((()(())())(()(()))()))()((())))(()(((()))))()())()))))()))))(())()((()()(()()))))(()(())))((())((())))))(()((((()(())()(()((((()))())))))((()))())()(()((()())()(((()((()(((()))
Output: 31

Example 2:

Input: ()(()()()()((((())))(()()(()(())(()()))(()))())))(())))))(()()()))(()(())())()((())())()(()(()(((()(()((())(())()()())()())))()()(()(())()())(()()(()())(((()((()())()()))))(((()))((()))()()())))()()))(())()()((((())()(()()())()))(())((()())))((()((()))(((((((
Output: 15

Example 3:

Input: ())((((((())(())))(()))((()())((((((()())()((())(()())()(()()(()))())()())(()()()((((())(((())()(((()))()((())))))(())()(((()(())())())(()))))))())())()())))((()))(()())()()(())))((()(()((())()))((())))(())(()()((((((())((()((((()()())))(()(()))()()()()))()(((((()(())(()()((((((()))(())))))((()())((()))()(()()())(()(((()((()(())))())))())()((()))())((())))()((((((()()()(((())((()()(()))())()()()(((()(()(((()()))())()(((((()(((()))()(()(()))()(()))()())())()((())))(())()())(((()()(()())()(()()()(((()()(())(()((())))((()(((())()((()())))))())()())()))())))((()())()))()(()((())())()(()(()()
Output: 30

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Wade's Ledger of scrolls - EASY Coding Problem | CodeTikki