Merge pull request #1 from rvguradiya/add-new-problem

Determine if three numbers sum to a specified value k

Author: umathomprakash09

problems/general/three_sum_to_k.md

@@ -0,0 +1,3 @@
+This problem was asked by **Microsoft**.
+
+Given an array of numbers and a number `k`, determine if there are three entries in the array which add up to the specified number `k`. For example, given `[20, 303, 3, 4, 25]` and `k = 49`, return true as `20 + 4 + 25 = 49`.

solutions/general/three_sum_to_k/Approach.java

@@ -0,0 +1,27 @@
+
+import javax.sound.midi.SysexMessage;
+
+
+public class Approach {
+
+    public static boolean  isHaveSum(int []arr,int k,int sum,int i){
+        if (sum == 0) {
+            return true;
+          } else if (i == arr.length || k == 0 || sum < 0) {
+            return false;
+          }
+
+          if (isHaveSum(arr, k - 1, sum - arr[i], i + 1) == true) {
+            return true;
+          } else {
+            return isHaveSum(arr, k, sum, i + 1);
+          }
+    }
+    public static void main(String[] args) {
+        int []arr = {20,303,3,4,25};
+        int k =3;
+        int sum = 49;
+
+        System.out.println(isHaveSum(arr, k, sum, 0));
+    }
+}

solutions/general/three_sum_to_k/approach.js

@@ -0,0 +1,22 @@
+let arr = [20, 303, 3, 4, 25];
+
+function isArrayHaveSumOfK(k, sum, arr) {
+  arr = arr;
+  n = arr.length;
+  function isArrayHaveSum(n, k, sum, i = 0) {
+    if (sum == 0) {
+      return true;
+    } else if (i == n || k == 0 || sum < 0) {
+      return false;
+    }
+    // console.log(k, sum, arr[i]);
+    if (isArrayHaveSum(n, k - 1, sum - arr[i], i + 1) == true) {
+      return true;
+    } else {
+      return isArrayHaveSum(n, k, sum, i + 1);
+    }
+  }
+  return isArrayHaveSum(n, k, sum, 0);
+}
+
+console.log(isArrayHaveSumOfK(3, 49, arr));