Generate Parentheses [C++-Solution required]
Closed this issue · 7 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?
Hi @tamal-kundu ! 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 !
I have written the code for the issue in the required language. Kindly have a look at it. #495
Reopening this issue for other contributors !
@aditya109 I also want to work on this issue can you please assign me?
HI @MashTerro ! 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, Thanks!