🎉 [q22] Ready

Author: enkr1

22/README.md

@@ -0,0 +1,23 @@
+https://leetcode.com/problems/generate-parentheses/
+
+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`

22/my_solution.js

@@ -0,0 +1,7 @@
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+var generateParenthesis = function(n) {
+
+};

README.md

@@ -1,11 +1,12 @@
 # Leetcode Solutions
 
-1. [Two Sum](./1/)
-2. [Add Two Numbers](./2/)
-3. [Longest Substring Without Repeating Characters](./3/)
-4. [Median of Two Sorted Arrays](./4/)
-5. [Longest Palindromic Substring](./5/)
-200. [Number of Islands](./200/)
+- [1. Two Sum](./1/)
+- [2. Add Two Numbers](./2/)
+- [3. Longest Substring Without Repeating Characters](./3/)
+- [4. Median of Two Sorted Arrays](./4/)
+- [5. Longest Palindromic Substring](./5/)
+- [7. Generate Parentheses](./7/)
+- [200. Number of Islands](./200/)
 
 ---