Add solution #1751

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,519 LeetCode solutions in JavaScript
+# 1,520 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1348,6 +1348,7 @@
 1748|[Sum of Unique Elements](./solutions/1748-sum-of-unique-elements.js)|Easy|
 1749|[Maximum Absolute Sum of Any Subarray](./solutions/1749-maximum-absolute-sum-of-any-subarray.js)|Medium|
 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|
 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|

solutions/1751-maximum-number-of-events-that-can-be-attended-ii.js

@@ -0,0 +1,54 @@
+/**
+ * 1751. Maximum Number of Events That Can Be Attended II
+ * https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/
+ * Difficulty: Hard
+ *
+ * You are given an array of events where events[i] = [startDayi, endDayi, valuei]. The ith event
+ * starts at startDayi and ends at endDayi, and if you attend this event, you will receive a value
+ * of valuei. You are also given an integer k which represents the maximum number of events you can
+ * attend.
+ *
+ * You can only attend one event at a time. If you choose to attend an event, you must attend the
+ * entire event. Note that the end day is inclusive: that is, you cannot attend two events where
+ * one of them starts and the other ends on the same day.
+ *
+ * Return the maximum sum of values that you can receive by attending events.
+ */
+
+/**
+ * @param {number[][]} events
+ * @param {number} k
+ * @return {number}
+ */
+var maxValue = function(events, k) {
+  events.sort((a, b) => a[0] - b[0]);
+  const n = events.length;
+  const dp = Array.from({ length: k + 1 }, () => new Array(n + 1).fill(-1));
+
+  return maximize(0, k);
+
+  function findNext(index, end) {
+    let left = index;
+    let right = n;
+    while (left < right) {
+      const mid = Math.floor((left + right) / 2);
+      if (events[mid][0] > end) {
+        right = mid;
+      } else {
+        left = mid + 1;
+      }
+    }
+    return left;
+  }
+
+  function maximize(index, remaining) {
+    if (index >= n || remaining === 0) return 0;
+    if (dp[remaining][index] !== -1) return dp[remaining][index];
+
+    const nextIndex = findNext(index + 1, events[index][1]);
+    const take = events[index][2] + maximize(nextIndex, remaining - 1);
+    const skip = maximize(index + 1, remaining);
+
+    return dp[remaining][index] = Math.max(take, skip);
+  }
+};