CT22269

Radiant inscriptions Bracket Audit

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The council of the old quarter of Brasshaven pays by the answer, and Ysolde intends to earn it. First: the full register of inscriptions. 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| <= 732; characters are '(' and ')'.

Example 1:

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

Example 2:

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

Example 3:

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

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Radiant inscriptions Bracket Audit - EASY Coding Problem | CodeTikki