FastPrep
Problem · String

Generate Parentheses

Learn this problem
● MediumAtlassian logoAtlassianFULLTIMEOA

Problem statement

Given n pairs of parentheses, return every well-formed sequence containing exactly those pairs.

Return the sequences in lexicographic order.

Function

generateParenthesis(n: int) → String[]

Examples

Example 1

n = 3return = ["((()))","(()())","(())()","()(())","()()()"]

These are all five balanced sequences using three pairs, ordered lexicographically.

Constraints

  • 1 <= n <= 8

More Atlassian problems

drafts saved locally
public String[] generateParenthesis(int n) {
  // Write your code here.
}
n3
expected["((()))", "(()())", "(())()", "()(())", "()()()"]
checking account