Generate parentheses
Generate all well-formed strings of n pairs of parentheses. Return them sorted lexicographically. For n = 0 return a list containing the single empty string. 0 <= n <= 8.
Implement
generate_parentheses(n: int) → list[str]Examples
in
[3]out["((()))","(()())","(())()","()(())","()()()"]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[3]["((()))","(()())","(())()","()(())","()()()"]not run yetsample