Interval Insertion
You are given a set of non-overlapping intervals sorted by their start times, and another interval to insert. Insert the new interval into the set and merge any overlapping intervals.
Example:
Input:
[[1,2], [3,9]]
[[4,6], [8,10], [11,12]]
Output should be:
[[1,2], [3,10], [11,12]]This problem asks you to insert a new interval into a sorted list of non-overlapping intervals, then merge any overlaps. A standard solution scans from left to right: first keep intervals ending before the new one starts, then merge all intervals that overlap the new interval by expanding its boundaries, and finally append the remaining intervals. The key is handling boundary cases correctly while preserving the sorted order.
END
