feat: merge-overlapping-intervals challenge

Author: IbatoLionDev

1-EASY/Python/11-merge-overlapping-intervals/proposed-solution/__pycache__/intervals.cpython-312.pyc

@@ -0,0 +1,16 @@
+def merge_intervals(intervals):
+    if not intervals:
+        return []
+
+    # Sort intervals based on the start time
+    intervals.sort(key=lambda x: x[0])
+    merged = [intervals[0]]
+
+    for current in intervals[1:]:
+        last = merged[-1]
+        if current[0] <= last[1]:  # Overlapping intervals
+            merged[-1] = [last[0], max(last[1], current[1])]
+        else:
+            merged.append(current)
+
+    return merged

1-EASY/Python/11-merge-overlapping-intervals/proposed-solution/intervals.py

@@ -0,0 +1,11 @@
+# Challenge: Given a list of intervals (e.g., [[1, 3], [2, 6], [8, 10]]), implement a function that merges all overlapping intervals and returns an array with the resulting intervals.
+
+from intervals import merge_intervals
+
+def main():
+    intervals = [[1, 3], [2, 6], [8, 10], [15, 18]]
+    merged = merge_intervals(intervals)
+    print("Merged intervals:", merged)
+
+if __name__ == "__main__":
+    main()