Add solution #325

Author: JoshCrozier

README.md

@@ -313,6 +313,7 @@
 322|[Coin Change](./solutions/0322-coin-change.js)|Medium|
 323|[Number of Connected Components in an Undirected Graph](./solutions/0323-number-of-connected-components-in-an-undirected-graph.js)|Medium|
 324|[Wiggle Sort II](./solutions/0324-wiggle-sort-ii.js)|Medium|
+325|[Maximum Size Subarray Sum Equals k](./solutions/0325-maximum-size-subarray-sum-equals-k.js)|Medium|
 326|[Power of Three](./solutions/0326-power-of-three.js)|Easy|
 327|[Count of Range Sum](./solutions/0327-count-of-range-sum.js)|Hard|
 328|[Odd Even Linked List](./solutions/0328-odd-even-linked-list.js)|Medium|

solutions/0325-maximum-size-subarray-sum-equals-k.js

@@ -0,0 +1,31 @@
+/**
+ * 325. Maximum Size Subarray Sum Equals k
+ * https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums and an integer k, return the maximum length of a subarray that
+ * sums to k. If there is not one, return 0 instead.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var maxSubArrayLen = function(nums, k) {
+  const sumIndex = new Map([[0, -1]]);
+  let currentSum = 0;
+  let result = 0;
+
+  for (let i = 0; i < nums.length; i++) {
+    currentSum += nums[i];
+    if (sumIndex.has(currentSum - k)) {
+      result = Math.max(result, i - sumIndex.get(currentSum - k));
+    }
+    if (!sumIndex.has(currentSum)) {
+      sumIndex.set(currentSum, i);
+    }
+  }
+
+  return result;
+};