Create: 0560-subarray-sum-equals-k

Author: Mohammed785

javascript/0560-subarray-sum-equals-k.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var subarraySum = function (nums, k) {
+    let count = 0,
+        sum = 0,
+        map = new Map();
+    map.set(0, 1);
+    for (const num of nums) {
+        sum += num;
+        if (map.has(sum - k)) {
+            count += map.get(sum - k);
+        }
+        map.set(sum, (map.get(sum) || 0) + 1);
+    }
+    return count;
+};

rust/0560-subarray-sum-equals-k.rs

@@ -0,0 +1,13 @@
+use std::collections::HashMap;
+impl Solution {
+    pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
+        let (mut count, mut sum, mut map) = (0, 0, HashMap::with_capacity(nums.len() / 2));
+        map.insert(0, 1);
+        for num in nums {
+            sum += num;
+            count += map.get(&(sum - k)).copied().unwrap_or(0);
+            map.entry(sum).and_modify(|e| *e = *e + 1).or_insert(1);
+        }
+        count
+    }
+}

typescript/0560-subarray-sum-equals-k.ts

@@ -0,0 +1,14 @@
+function subarraySum(nums: number[], k: number): number {
+    let count = 0,
+        sum = 0,
+        map = new Map<number, number>();
+    map.set(0, 1);
+    for (const num of nums) {
+        sum += num;
+        if (map.has(sum - k)) {
+            count += map.get(sum - k);
+        }
+        map.set(sum, (map.get(sum) || 0) + 1);
+    }
+    return count;
+}