Insert a new interval into a sorted non-overlapping list

Approach

• Add interval, sort by start, then merge overlapping neighbors.
• Or single pass: skip intervals ending before new start, merge overlaps, append rest.

Java Solution

public int[][] insert(int[][] intervals, int[] newInterval) {
    List<int[…