Files
cpp-flashcards/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org
T
2026-06-01 18:17:37 +08:00

790 B

TODO 0022. Generate Parentheses   medium

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

Example 1:

Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]

Example 2:

Input: n = 1
Output: ["()"]

Constraints:

  • 1 <= n <= 8

TODO Approach

Write your approach here.

TODO Python

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

TODO C++

class Solution {
public:
    vector<string> generateParenthesis(int n) {
        
    }
};