Backtrack by appending '(' as long as open-count is below n, and ')' as long as close-count is below open-count.

Generate Parentheses

medium

Acceptance: 52%

BacktrackingStrings

Given an integer n, produce every arrangement of n pairs of parentheses that is syntactically balanced.

Example 1:

Input:n = 2

Output:["(())","()()"]

Example 2:

Input:n = 4

Output:

["(((())))","((())())","((()))()","(()(()))","(()()())","(()())()","(())(())","(())()()","()((()))","()(()())","()(())()","()()(())","()()()()"]

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}