The program reads from standard input an expression. Only brackets are of interest: round (), square [], and curly {}. All other characters are ignored.
The expression has balanced brackets if:
For example, ([]{}) and {[()]} are balanced, but ([)] is not.
The program reads from standard input a single line with the expression (at most 1000 characters long). The line may be empty.
The program prints to standard output: - `DA` if the brackets in the expression are balanced; - `NU` otherwise. An expression with no brackets at all is considered balanced.
{[a+(b*c)]-d}
DA
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
{[a+(b*c)]-d}
DA
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.