<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]:
        

        res = []
        temp = []
        def dfs(o,c):
            if o + c == n * 2:
                res.append(''.join(temp))
                return 
            
            if o < n:
                temp.append('(')
                dfs(o + 1, c)
                temp.pop()
            if o > c:
                temp.append(')')
                dfs(o, c + 1)
                temp.pop()

        dfs(0,0)
        return res
        
16900