terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#22
Generate Parentheses
Medium
Acceptance 0%
Editorial
description
Problem Description
Given `n` pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
checklist
Constraints
1 <= n <= 8
science
Examples
Case #1
In:
n = 3
Out:
["((()))","(()())","(())()","()(())","()()()"]
Case #2
In:
n = 1
Out:
["()"]
Mastery Tags
Backtracking
Dynamic Programming
Strings
Hiring Companies
Amazon
Google
Microsoft
code
Integrated IDE
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def generateParenthesis(self, n: int) -> list[str]: pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration