In this post, you will know how to solve the Generate Parentheses Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.Generate Parentheses Leetcode SolutionsOne more thing to add, don’t directly look for the solutions, first try to solve the problems of Leetcode by yourself. If you find any difficulty after trying several times, then you can look for solutions.ProblemGiven 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: ["()"] Constraints:1 <= n <= 8Generate Parentheses Leetcode Solutions in Pythonclass Solution: def generateParenthesis(self, n): ans = [] def dfs(l: int, r: int, s: str) -> None: if l == 0 and r == 0: ans.append(s) if l > 0: dfs(l - 1, r, s + '(') if l < r: dfs(l, r - 1, s + ')') dfs(n, n, '') return ans Generate Parentheses Leetcode Solutions in CPPclass Solution { public: vector<string> generateParenthesis(int n) { vector<string> ans; dfs(n, n, "", ans); return ans; } private: void dfs(int l, int r, string&& path, vector<string>& ans) { if (l == 0 && r == 0) { ans.push_back(path); return; } if (l > 0) { path.push_back('('); dfs(l - 1, r, move(path), ans); path.pop_back(); } if (l < r) { path.push_back(')'); dfs(l, r - 1, move(path), ans); path.pop_back(); } } }; Generate Parentheses Leetcode Solutions in Javaclass Solution { public List<String> generateParenthesis(int n) { List<String> ans = new ArrayList<>(); dfs(n, n, new StringBuilder(), ans); return ans; } private void dfs(int l, int r, final StringBuilder sb, List<String> ans) { if (l == 0 && r == 0) { ans.add(sb.toString()); return; } if (l > 0) { sb.append("("); dfs(l - 1, r, sb, ans); sb.deleteCharAt(sb.length() - 1); } if (l < r) { sb.append(")"); dfs(l, r - 1, sb, ans); sb.deleteCharAt(sb.length() - 1); } } } Note: This problem Generate Parentheses is generated by Leetcode but the solution is provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.NEXT: N-Queens II Leetcode Solution Post navigationRemove Nth Node From End of List Leetcode Solution N-Queens II Leetcode Solution