Merge pull request neetcode-gh#2548 from aadil42/patch-48

Author: aakhtar3

javascript/0523-continuous-subarray-sum.js

@@ -0,0 +1,24 @@
+/**
+ * https://leetcode.com/problems/continuous-subarray-sum/
+ * Hasing
+ * Time O(n) | Space O(n)
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var checkSubarraySum = function(arr, k) {
+    let sum = 0;
+    const remainderMap = new Map([ [0, -1] ]);
+  
+    for(let i = 0; i < arr.length;  i++) {
+        sum += arr[i];
+        if(remainderMap.has(sum%k) && i - remainderMap.get(sum%k) > 1) {
+            return true;
+        } 
+        if(!remainderMap.has(sum%k)) {
+            remainderMap.set(sum%k,i);
+        } 
+    }
+   
+    return false;
+  };