cpp-flashcards/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org

#+ANKI_DECK: study_deck_02
* TODO 0022. Generate Parentheses :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0022. Generate Parentheses][0022. Generate Parentheses]]
:END:

Given ~n~ pairs of parentheses, write a function to /generate all combinations of well-formed parentheses/.

*Example 1:*


#+begin_src
Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]
#+end_src
*Example 2:*


#+begin_src
Input: n = 1
Output: ["()"]
#+end_src


*Constraints:*

 - ~1 <= n <= 8~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 22 :lc-lang python3
class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 22
class Solution {
public:
    vector<string> generateParenthesis(int n) {
        
    }
};
#+end_src