Jul 08

Author: siddydutta

2025-07-July-LeetCoding-Challenge/Maximum Number of Events That Can Be Attended II.py

@@ -0,0 +1,35 @@
+from bisect import bisect_right
+from functools import lru_cache
+
+
+class Solution:
+    def maxValue(self, events: list[list[int]], k: int) -> int:
+        events.sort()
+        start_times = [start for start, end, value in events]
+
+        @lru_cache(None)
+        def dp(idx: int, k: int) -> int:
+            if k == 0 or idx == len(events):
+                return 0
+            next_event_idx = bisect_right(start_times, events[idx][1])
+            return max(dp(idx + 1, k), dp(next_event_idx, k - 1) + events[idx][2])
+
+        return dp(0, k)
+
+
+def main():
+    events = [[1, 2, 4], [3, 4, 3], [2, 3, 1]]
+    k = 2
+    assert Solution().maxValue(events, k) == 7
+
+    events = [[1, 2, 4], [3, 4, 3], [2, 3, 10]]
+    k = 2
+    assert Solution().maxValue(events, k) == 10
+
+    events = [[1, 1, 1], [2, 2, 2], [3, 3, 3], [4, 4, 4]]
+    k = 3
+    assert Solution().maxValue(events, k) == 9
+
+
+if __name__ == '__main__':
+    main()

2025-07-July-LeetCoding-Challenge/README.md

@@ -11,7 +11,7 @@
 | July 05 | [1394. Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/) | Easy | Solved |
 | July 06 | [1865. Finding Pairs With a Certain Sum](https://leetcode.com/problems/finding-pairs-with-a-certain-sum/) | Medium | Solved |
 | July 07 | [1353. Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/) | Medium | Solved |
-| July 08 | []() |  |  |
+| July 08 | [1751. Maximum Number of Events That Can Be Attended II](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/) | Hard | Solved |
 | July 09 | []() |  |  |
 | July 10 | []() |  |  |
 | July 11 | []() |  |  |
@@ -42,4 +42,4 @@
 | ---    | --- | --- | --- |
 | Easy   | 3 | 3 | 0 |
 | Medium | 2 | 2 | 0 |
-| Hard   | 2 | 0 | 2 |
+| Hard   | 3 | 1 | 2 |