Add solution #1423

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,296 LeetCode solutions in JavaScript
+# 1,297 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1088,6 +1088,7 @@
 1419|[Minimum Number of Frogs Croaking](./solutions/1419-minimum-number-of-frogs-croaking.js)|Medium|
 1420|[Build Array Where You Can Find The Maximum Exactly K Comparisons](./solutions/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons.js)|Hard|
 1422|[Maximum Score After Splitting a String](./solutions/1422-maximum-score-after-splitting-a-string.js)|Easy|
+1423|[Maximum Points You Can Obtain from Cards](./solutions/1423-maximum-points-you-can-obtain-from-cards.js)|Medium|
 1431|[Kids With the Greatest Number of Candies](./solutions/1431-kids-with-the-greatest-number-of-candies.js)|Easy|
 1436|[Destination City](./solutions/1436-destination-city.js)|Easy|
 1437|[Check If All 1's Are at Least Length K Places Away](./solutions/1437-check-if-all-1s-are-at-least-length-k-places-away.js)|Easy|

solutions/1423-maximum-points-you-can-obtain-from-cards.js

@@ -0,0 +1,35 @@
+/**
+ * 1423. Maximum Points You Can Obtain from Cards
+ * https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/
+ * Difficulty: Medium
+ *
+ * There are several cards arranged in a row, and each card has an associated number of
+ * points. The points are given in the integer array cardPoints.
+ *
+ * In one step, you can take one card from the beginning or from the end of the row.
+ * You have to take exactly k cards.
+ *
+ * Your score is the sum of the points of the cards you have taken.
+ *
+ * Given the integer array cardPoints and the integer k, return the maximum score you can obtain.
+ */
+
+/**
+ * @param {number[]} cardPoints
+ * @param {number} k
+ * @return {number}
+ */
+var maxScore = function(cardPoints, k) {
+  const totalLength = cardPoints.length;
+  const windowSize = totalLength - k;
+  let windowSum = cardPoints.slice(0, windowSize).reduce((sum, num) => sum + num, 0);
+  let minWindowSum = windowSum;
+  const totalSum = cardPoints.reduce((sum, num) => sum + num, 0);
+
+  for (let i = windowSize; i < totalLength; i++) {
+    windowSum = windowSum + cardPoints[i] - cardPoints[i - windowSize];
+    minWindowSum = Math.min(minWindowSum, windowSum);
+  }
+
+  return totalSum - minWindowSum;
+};