@@ -2,6 +2,5 @@
 
 + Valid Sudoku [LeetCode #36](https://leetcode.com/problems/valid-sudoku/)
 + Letter Combination of a Phone Number [LeetCode #17](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)
-+ Generate Parentheses [LeetCode #22](https://leetcode.com/problems/generate-parentheses/)
 + Wildcard Matching [LeetCode #44](https://leetcode.com/problems/wildcard-matching/)
 + N-Queens [LeetCode #51](https://leetcode.com/problems/n-queens/)
@@ -0,0 +1,23 @@
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+const generateParenthesis = function(n) {
+    if (n === 0) {
+        return [""];
+    }
+    let result = [];
+    for (let i = 0; i < n; ++i) {
+        let lefts = generateParenthesis(i);
+        let rights = generateParenthesis(n - i - 1);
+
+        for (let l = 0; l < lefts.length; ++l) {
+            for (let r = 0; r < rights.length; ++r) {
+                result.push("(" + lefts[l] + ")" + rights[r]);
+            }
+        }
+    }
+    return result;
+};
+
+console.log(generateParenthesis(3));