Read a positive natural number n. Generate and print in lexicographic
order all expressions formed from exactly n opening parentheses (
and n closing parentheses ) such that the expression is well-formed
(at every prefix the number of ( is at least the number of )).
Lexicographic order treats ( as smaller than ).
The program reads from standard input a single natural number, `n`. - `1 <= n <= 6`
The program prints all well-formed expressions, one per line, with no spaces between parentheses.
3
((())) (()()) (())() ()(()) ()()()
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
3
((())) (()()) (())() ()(()) ()()()
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.
