Dec 8

Author: siddydutta

2024-12-December-LeetCoding-Challenge/README.md

@@ -10,7 +10,7 @@
 | December 5  | [2337. Move Pieces to Obtain a String](https://leetcode.com/problems/move-pieces-to-obtain-a-string/) | Medium | Unsolved |
 | December 6  | [2554. Maximum Number of Integers to Choose From a Range I](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/) | Medium | Solved |
 | December 7  | [1760. Minimum Limit of Balls in a Bag](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/) | Medium | Solved |
-| December 8  | []() |  |  |
+| December 8  | [2054. Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/) | Medium | Solved |
 | December 9  | []() |  |  |
 | December 10 | []() |  |  |
 | December 11 | []() |  |  |
@@ -39,5 +39,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 2 | 2 | 0 |
-| Medium | 5 | 4 | 1 |
+| Medium | 6 | 5 | 1 |
 | Hard   | 0 | 0 | 0 |

2024-12-December-LeetCoding-Challenge/Two Best Non-Overlapping Events.py

@@ -0,0 +1,38 @@
+from bisect import bisect
+from itertools import accumulate
+from typing import List
+
+
+class Solution:
+    def maxTwoEvents(self, events: List[List[int]]) -> int:
+        n = len(events)
+        # first sort by value
+        events.sort(key=lambda event: event[2], reverse=True)
+        # then sort by start times
+        events.sort(key=lambda event: event[0])
+        start_times = [event[0] for event in events]
+        max_val = float('-inf')
+        max_indices = accumulate([event[2] for event in events][::-1], max)
+        max_indices = list(max_indices)[::-1]
+
+        for _, end, value in events:
+            max_val = max(max_val, value)
+            index = bisect(start_times, end)
+            if index < n:
+                max_val = max(max_val, value+max_indices[index])
+        return max_val
+
+
+def main():
+    events = [[1, 3, 2], [4, 5, 2], [2, 4, 3]]
+    assert Solution().maxTwoEvents(events) == 4
+
+    events = [[1, 3, 2], [4, 5, 2], [1, 5, 5]]
+    assert Solution().maxTwoEvents(events) == 5
+
+    events = [[1, 5, 3], [1, 5, 1], [6, 6, 5]]
+    assert Solution().maxTwoEvents(events) == 8
+
+
+if __name__ == '__main__':
+    main()