combination-sum-ii

malipramod · malipramod · commit 67beae6a848e · 2019-09-03T15:05:17.000+05:30
diff --git a/medium/0040 combination-sum-ii/combination-sum-ii.js b/medium/0040 combination-sum-ii/combination-sum-ii.js
@@ -0,0 +1,30 @@
+/**
+ * @param {number[]} candidates
+ * @param {number} target
+ * @return {number[][]}
+ */
+var combinationSum2 = function (candidates, target) {
+    candidates.sort((a, b) => a - b);
+
+    let result = [];
+    let tempResult = [];
+    search(0, target);
+    return result;
+
+    function search(current, leftoverTarget) {
+        if (leftoverTarget === 0 && current === candidates.length)
+            return result.push(tempResult.slice());
+
+        if (leftoverTarget < 0 || current === candidates.length) return;
+
+        tempResult.push(candidates[current]);
+
+        search(current + 1, leftoverTarget - candidates[current]);
+        tempResult.pop();
+        if (tempResult[tempResult.length - 1] !== candidates[current])
+            search(current + 1, leftoverTarget);
+    }
+};
+
+console.log(combinationSum2([10, 1, 2, 7, 6, 1, 5], 8))
+console.log(combinationSum2([2, 5, 2, 1, 2], 5))
diff --git a/medium/0040 combination-sum-ii/readme.md b/medium/0040 combination-sum-ii/readme.md
@@ -0,0 +1,47 @@
+# Combination Sum II
+
+Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
+
+Each number in candidates may only be used once in the combination.
+
+Note:
+
+All numbers (including target) will be positive integers.
+
+The solution set must not contain duplicate combinations.
+
+## Example 1
+
+Input: candidates = [10,1,2,7,6,1,5], target = 8,
+
+A solution set is:
+
+[
+
+  [1, 7],
+
+  [1, 2, 5],
+
+  [2, 6],
+
+  [1, 1, 6]
+
+]
+
+## Example 2
+
+Input: candidates = [2,5,2,1,2], target = 5,
+
+A solution set is:
+
+[
+
+  [1,2,2],
+
+  [5]
+
+]
+
+## More Info
+
+<https://leetcode.com/problems/combination-sum-ii/>
