Generate Parenthesis Given a number N LeetCode

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: ["()"]

NOTE:

• 1 <= n <= 8

This problem is popular in LeetCode and GeeksForGeeks A collection of hundreds of interview questions and solutions are available in our blog at Interview Question Solutions

Solution

Source: Java 1, Java 2, Java 3, Java 4, Java 5