Files
cpp-flashcards/org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org
T
tomatocream 1dec88aaf2 feat: populate note files with problem descriptions and code stubs
Add populate-notes.mjs that fetches problem descriptions and
Python/C++ code stubs from LeetCode's GraphQL API. Populated
all 197 NeetCode 150 note files with:
- Problem description (examples, constraints)
- Python code stub (function signature)
- C++ code stub (function signature + includes)

API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
2026-06-01 17:22:07 +08:00

789 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) {
        
    }
};