Generate Parentheses [Java-Solution required]
Closed this issue ยท 8 comments
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: ["()"]
Constraints:
1 <= n <= 8
Reference: https://leetcode.com/problems/generate-parentheses/
i can solve this issue ..can u plzz assign me?
Please assign this issue to me @aditya109 ...
I am in my 5th semester and preparing these types of questions..
Will update the solution as fast as possible.
Hi @sbaijal ! Good luck on your semester. have assigned this issue to you. Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines. Also, if it is not too much to ask, please consider starring โญ the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking !
Hi, i want to contribute. :)
As it has been 7 days and no response from the previous assignee, hence clearing the assignee @sbaijal ! ๐
Hi @akankshatyagiat ! Sure thing. I have assigned this issue to you.
Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines.
Also, if it is not too much to ask, please consider starring โญ the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking !
Sure, thankyou. will raise the PR as soon as possible. :) :)
@aditya109 please assign this to me.