2
\$\begingroup\$

For example, given 3 sets of parenthesis, you have:

()()()
((()))
()(())
(())()
(()())

= 5 possible combinations.

Challenge

Program must:

• Take 1 number as an input

• Return one output, the number of possible combinations of parenthesis sets

Shortest number of bytes wins

\$\endgroup\$
7