LeetCode-Top-Interview-150 | 🚀 LeetCode-Top-Interview-150 : Join me on a 150-day journey of solving one programming problem from LeetCode daily! 💻 Each day’s folder includes the problem statement 📜, my solution 💾, and notes 📝. Follow my progress, learn coding, and contribute your insights! Let’s conquer code together! 💪 #LeetCode #CodingChallenge

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