Generate Parentheses - Read Statement

Given $n$ pairs of parentheses, generate all combinations of well-formed parentheses.

Example: For $n=3$, return ["((()))","(()())","(())()","()(())","()()()"]. The number of valid combinations is the $n$th Catalan number.