Insert and Merge Interval Problem

Insert and Merge Interval Problem — ExecCode Medium DSA Practice

Solve the Insert and Merge Interval problem on ExecCode. Free online medium DSA practice in Intervals. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Imagine you're solving Insert and Merge Interval in a real system where you must be correct and efficient. Problem Given a set of non-overlapping intervals sorted by their start time, insert a new interval into the intervals (merge if necessary). Input: Intervals and new interval. Output: Updated intervals. Constraints: 0 <= intervals.length <= 10^4 Constraints 0 <= intervals.length <= 10^4

Examples

Input [[1,3],[6,9]] [2,5]; Output [[1,5],[6,9]]. Input [[1,2],[3,5],[6,7],[8,10],[12,16]] [4,8]; Output [[1,2],[3,10],[12,16]]

Constraints

0 <= intervals.length <= 10^4

Practice Insert and Merge Interval free on ExecCode. Browse DSA problems, topic map, and placement guides.