Practice Insert Interval

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#57

LeetCode Problem

Insert Interval

Array

Problem Statement

You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval. Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary). Return intervals after the insertion. Note that you don't need to modify intervals in-place. You can make a new array and return it.

Source: Insert Interval on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

intervals = [[1,3],[6,9]], newInterval = [2,5]

Output

[[1,5],[6,9]]

# Example 2

Input

intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]

Output

[[1,2],[3,10],[12,16]]

Constraints

0 <= intervals.length <= 10^4

intervals[i].length == 2

0 <= start_i <= end_i <= 10^5

intervals is sorted by start_i in ascending order.

newInterval.length == 2

0 <= start <= end <= 10^5

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free