CT28561

Wade's Ledger of scrolls

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Before the gates of the lily shoals of Padmore close for winter, Wade must finish the scrolls ledger - one figure at a time. 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| <= 750; characters are '(' and ')'.

Example 1:

Input: ((()(((())(())()))))()((()())())((())()())()()(())()))(((()((())())(((())))())(()()(()))()))))())))((((())))()()(((()()()((())(())()(((()((())))((()((()()))(()(())(())((((()(()))()((()(((((())((((((()()((()()))(())))((())()))()()(())()))))((((((()(((()))())(()()(()))))((()(())(()(((()(())((()(()()()))())((()))))()()((())()())(())))()((((()))))(()()(((()()))(()((()))())(())(())(()()()))())((()()())((((()(()))()()())))()))((()(())))((()()((())()))))())())))((()()(()()))((()(((()))))(()((())))(()(())()())(()())(())())(())()()))(())((()()()()))(())))())()))())
Output: 18

Example 2:

Input: ))))()(((((()()))()()(()(())())((())))))))()(()))(()())(()))(()))((()(()())()()((()()()))))()(()(()(()))()((()(((())))())))()))(()))()))(())))(((())))(((
Output: 19

Example 3:

Input: (()()()()((((()))))()()))()(()(())())))()))()()(()())()(()(())())())))()()())((()))()))((())))())(((())()()))(()()))))(()((())(())())()(()))()())())((()))()()))(())))())()(()(()()((())()))))()((())))())()(()(((((())(()((()())()(())(()))()))()))()(((()((())((
Output: 34

Constraints:

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

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