Add solution #1717

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,496 LeetCode solutions in JavaScript
+# 1,497 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1322,6 +1322,7 @@
 1712|[Ways to Split Array Into Three Subarrays](./solutions/1712-ways-to-split-array-into-three-subarrays.js)|Medium|
 1713|[Minimum Operations to Make a Subsequence](./solutions/1713-minimum-operations-to-make-a-subsequence.js)|Hard|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
+1717|[Maximum Score From Removing Substrings](./solutions/1717-maximum-score-from-removing-substrings.js)|Medium|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|
 1732|[Find the Highest Altitude](./solutions/1732-find-the-highest-altitude.js)|Easy|

solutions/1717-maximum-score-from-removing-substrings.js

@@ -0,0 +1,52 @@
+/**
+ * 1717. Maximum Score From Removing Substrings
+ * https://leetcode.com/problems/maximum-score-from-removing-substrings/
+ * Difficulty: Medium
+ *
+ * You are given a string s and two integers x and y. You can perform two types of operations
+ * any number of times.
+ *
+ * - Remove substring "ab" and gain x points.
+ *   - For example, when removing "ab" from "cabxbae" it becomes "cxbae".
+ * - Remove substring "ba" and gain y points.
+ *   - For example, when removing "ba" from "cabxbae" it becomes "cabxe".
+ *
+ * Return the maximum points you can gain after applying the above operations on s.
+ */
+
+/**
+ * @param {string} s
+ * @param {number} x
+ * @param {number} y
+ * @return {number}
+ */
+var maximumGain = function(s, x, y) {
+  let result = 0;
+  const stack = [];
+
+  const [primary, secondary, primaryScore, secondaryScore] = x >= y
+    ? ['ab', 'ba', x, y]
+    : ['ba', 'ab', y, x];
+
+  for (const char of s) {
+    if (stack.length && stack[stack.length - 1] === primary[0] && char === primary[1]) {
+      stack.pop();
+      result += primaryScore;
+    } else {
+      stack.push(char);
+    }
+  }
+
+  const remaining = [];
+  for (const char of stack) {
+    if (remaining.length && remaining[remaining.length - 1] === secondary[0]
+        && char === secondary[1]) {
+      remaining.pop();
+      result += secondaryScore;
+    } else {
+      remaining.push(char);
+    }
+  }
+
+  return result;
+};