Update Merge Intervals - Leetcode 56.py

Author: gahogg

Merge Intervals - Leetcode 56/Merge Intervals - Leetcode 56.py

@@ -12,3 +12,23 @@ def merge(self, intervals: List[List[int]]) -> List[List[int]]:
         return merged
         # Time: O(n log n)
         # Space: O(n)
+
+
+class Solution:
+    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
+        intervals.sort(key=lambda x: x[0])  # Sort by start time
+        i = 0  # Index to track merged intervals
+        n = len(intervals)
+
+        for j in range(1, n):
+            # Check if the current interval overlaps with the previous one
+            if intervals[i][1] >= intervals[j][0]:  
+                intervals[i][1] = max(intervals[i][1], intervals[j][1])  # Merge
+            else:
+                i += 1
+                intervals[i] = intervals[j]  # Move next non-overlapping interval
+
+        return intervals[:i+1]  # Return the relevant merged portion
+
+        # Time: O(n log n)
+        # Space: O(1)