<p>Given <code>n</code> pairs of parentheses, write a function to <em>generate all combinations of well-formed parentheses</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> n = 3
<strong>Output:</strong> ["((()))","(()())","(())()","()(())","()()()"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> n = 1
<strong>Output:</strong> ["()"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 8</code></li>
</ul>

class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
        results: List[str] = []

        max_len = n * 2
        def recursive(left: int, right: int, text: str):
            if len(text) == max_len:
                results.append(text)
                return
            
            if left < n:
                recursive(left + 1, right, text + "(")
            
            if right < left:
                recursive(left, right + 1, text + ")")

        recursive(0, 0, "")
        return results
        
16400