Add solution #1537

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,352 LeetCode solutions in JavaScript
+# 1,353 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1174,6 +1174,7 @@
 1534|[Count Good Triplets](./solutions/1534-count-good-triplets.js)|Easy|
 1535|[Find the Winner of an Array Game](./solutions/1535-find-the-winner-of-an-array-game.js)|Medium|
 1536|[Minimum Swaps to Arrange a Binary Grid](./solutions/1536-minimum-swaps-to-arrange-a-binary-grid.js)|Medium|
+1537|[Get the Maximum Score](./solutions/1537-get-the-maximum-score.js)|Hard|
 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/1537-get-the-maximum-score.js

@@ -0,0 +1,55 @@
+/**
+ * 1537. Get the Maximum Score
+ * https://leetcode.com/problems/get-the-maximum-score/
+ * Difficulty: Hard
+ *
+ * You are given two sorted arrays of distinct integers nums1 and nums2.
+ *
+ * A valid path is defined as follows:
+ * - Choose array nums1 or nums2 to traverse (from index-0).
+ * - Traverse the current array from left to right.
+ * - If you are reading any value that is present in nums1 and nums2 you are allowed to change
+ *   your path to the other array. (Only one repeated value is considered in the valid path).
+ *
+ * The score is defined as the sum of unique values in a valid path.
+ *
+ * Return the maximum score you can obtain of all possible valid paths. Since the answer may be
+ * too large, return it modulo 109 + 7.
+ */
+
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number}
+ */
+var maxSum = function(nums1, nums2) {
+  const MOD = 1e9 + 7;
+  const m = nums1.length;
+  const n = nums2.length;
+  let i = 0;
+  let j = 0;
+  let sum1 = 0;
+  let sum2 = 0;
+
+  while (i < m && j < n) {
+    if (nums1[i] < nums2[j]) {
+      sum1 += nums1[i++];
+    } else if (nums1[i] > nums2[j]) {
+      sum2 += nums2[j++];
+    } else {
+      sum1 = sum2 = Math.max(sum1, sum2) + nums1[i];
+      i++;
+      j++;
+    }
+  }
+
+  while (i < m) {
+    sum1 += nums1[i++];
+  }
+
+  while (j < n) {
+    sum2 += nums2[j++];
+  }
+
+  return Math.max(sum1, sum2) % MOD;
+};