Add solution #1753

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,520 LeetCode solutions in JavaScript
+# 1,521 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1350,6 +1350,7 @@
 1750|[Minimum Length of String After Deleting Similar Ends](./solutions/1750-minimum-length-of-string-after-deleting-similar-ends.js)|Medium|
 1751|[Maximum Number of Events That Can Be Attended II](./solutions/1751-maximum-number-of-events-that-can-be-attended-ii.js)|Hard|
 1752|[Check if Array Is Sorted and Rotated](./solutions/1752-check-if-array-is-sorted-and-rotated.js)|Easy|
+1753|[Maximum Score From Removing Stones](./solutions/1753-maximum-score-from-removing-stones.js)|Medium|
 1764|[Form Array by Concatenating Subarrays of Another Array](./solutions/1764-form-array-by-concatenating-subarrays-of-another-array.js)|Medium|
 1765|[Map of Highest Peak](./solutions/1765-map-of-highest-peak.js)|Medium|
 1768|[Merge Strings Alternately](./solutions/1768-merge-strings-alternately.js)|Easy|

solutions/1753-maximum-score-from-removing-stones.js

@@ -0,0 +1,32 @@
+/**
+ * 1753. Maximum Score From Removing Stones
+ * https://leetcode.com/problems/maximum-score-from-removing-stones/
+ * Difficulty: Medium
+ *
+ * You are playing a solitaire game with three piles of stones of sizes a, b, and c respectively.
+ * Each turn you choose two different non-empty piles, take one stone from each, and add 1 point
+ * to your score. The game stops when there are fewer than two non-empty piles (meaning there are
+ * no more available moves).
+ *
+ * Given three integers a, b, and c return the maximum score you can get.
+ */
+
+/**
+ * @param {number} a
+ * @param {number} b
+ * @param {number} c
+ * @return {number}
+ */
+var maximumScore = function(a, b, c) {
+  const piles = [a, b, c].sort((x, y) => y - x);
+  let score = 0;
+
+  while (piles[0] > 0 && piles[1] > 0) {
+    piles[0]--;
+    piles[1]--;
+    score++;
+    piles.sort((x, y) => y - x);
+  }
+
+  return score;
+};