Add solution #1546

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,359 LeetCode solutions in JavaScript
+# 1,360 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1181,6 +1181,7 @@
 1542|[Find Longest Awesome Substring](./solutions/1542-find-longest-awesome-substring.js)|Hard|
 1544|[Make The String Great](./solutions/1544-make-the-string-great.js)|Easy|
 1545|[Find Kth Bit in Nth Binary String](./solutions/1545-find-kth-bit-in-nth-binary-string.js)|Medium|
+1546|[Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](./solutions/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.js)|Medium|
 1550|[Three Consecutive Odds](./solutions/1550-three-consecutive-odds.js)|Easy|
 1551|[Minimum Operations to Make Array Equal](./solutions/1551-minimum-operations-to-make-array-equal.js)|Medium|
 1566|[Detect Pattern of Length M Repeated K or More Times](./solutions/1566-detect-pattern-of-length-m-repeated-k-or-more-times.js)|Easy|

solutions/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.js

@@ -0,0 +1,35 @@
+/**
+ * 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
+ * https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/
+ * Difficulty: Medium
+ *
+ * Given an array nums and an integer target, return the maximum number of non-empty non-overlapping
+ * subarrays such that the sum of values in each subarray is equal to target.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var maxNonOverlapping = function(nums, target) {
+  const prefixSums = new Map();
+  let currentSum = 0;
+  let result = 0;
+  prefixSums.set(0, 0);
+
+  for (let i = 0; i < nums.length; i++) {
+    currentSum += nums[i];
+
+    if (prefixSums.has(currentSum - target)) {
+      result++;
+      prefixSums.clear();
+      prefixSums.set(0, i + 1);
+      currentSum = 0;
+    } else {
+      prefixSums.set(currentSum, i + 1);
+    }
+  }
+
+  return result;
+};