@@ -4,6 +4,5 @@
 + Regular Expression Matching [LeetCode #10](https://leetcode.com/problems/regular-expression-matching/)
 + 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/)
-+ Combination Sum [LeetCode #39](https://leetcode.com/problems/combination-sum/)
 + Wildcard Matching [LeetCode #44](https://leetcode.com/problems/wildcard-matching/)
 + N-Queens [LeetCode #51](https://leetcode.com/problems/n-queens/)
@@ -0,0 +1,40 @@
+/**
+ * @param {number[]} candidates
+ * @param {number} target
+ * @return {number[][]}
+ */
+var combinationSum = function(candidates, target) {
+    var result = [];
+
+    if (candidates == null || candidates.length === 0) { 
+        return result;
+    };
+ 
+    var current = [];
+    candidates.sort();
+ 
+    combinationSumHelper(candidates, target, 0, current, result);
+ 
+    return result;
+};
+
+function combinationSumHelper(candidates, target, j, curr, result){
+    if(target === 0){
+        var temp = curr.slice();
+        result.push(temp);
+        return;
+    }
+  
+    for(var i=j; i<candidates.length; i++){
+        if(target < candidates[i]) {
+            return;
+        }
+        curr.push(candidates[i]);
+        combinationSumHelper(candidates, target - candidates[i], i, curr, result);
+        curr.pop(); 
+    }
+ }
+
+const candidates = [2,3,6,7];
+const target = 7;
+console.log(combinationSum(candidates, target));