To confirm, we can follow another similar approach to "Merge Intervals" with sorting removed by inserting the new interval into the list of intervals based on start value. So insert into the first index where new_interval[start] is greater than intervals[i][start]? We then perform the rest of the "Merge Intervals" logic to avoid having to set new_interval[start] = min(new_interval[start], intervals[i][start]).