CT22423

The Bracket Audit of Chessfield

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The harbor bell rings at the rook towers of Chessfield; Ivo weighs the day's sigils manifests and starts the calculations. Task: A string contains only '(' and ')'. Print YES if it is a balanced bracket sequence, otherwise NO. Input format: One line with a string of parentheses. Output format: Print YES or NO. Constraints: 1 <= |s| <= 1994; characters are '(' and ')'.

Example 1:

Input: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
Output: YES

Example 2:

Input: ())))(((((())))()))((())())()(()())()()))(()()(()(()()))))()(())))())(())))))()(()()())(()())()()(((()()))(()()(())))((()()))))))((())()((()))(()()()(()((())((())()(()((((())(((()()()))))())())))))((()(()(()()))(((())))()())((())()()())()(((()()()())))(()))()()()((()())())(()))()()()))(())()))())))(())()))(((()())())(()(((((()((()))()))(()(()(()()))()()(()()()(()())())()(()))(()()))())((()())((((()))((())()()())()())((((()(())(())(()((()()())()(()))(())))()()()((())((())())))(((((()))(()(((())))))))())()((()))(()))))))((()()))(())))()))()()))))))))())))(((()(())((()())(((()))()(())))))())))(()((()))((()(()))))(()()(())())((())((()())())((()(((()(()))()()())(())(()()))((()())))))()))()(())(())((()(()((()((()(()()()()())(())((()(()(())()()))()()(()))((((()((())(()())((())(()())()((()()(())())()())(()()()(()(()()))(())))()()))(()(()(()(()((())(())()))()(()(()())(()()))(()())((((()()()(())((()())((((()(())())))))
Output: NO

Example 3:

Input: (((()(((()))()()())))((()))()((()(((())())((()((()((()))())))()(())()((()()(())))(
Output: NO

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Bracket Audit of Chessfield - EASY Coding Problem | CodeTikki