def insert(intervals: list[list[int]], newInterval: list[int]) -> list[list[int]]:public List<int[]> insert(List<int[]> intervals, int[] newInterval)vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval)function insert(intervals, newInterval)
def insert(intervals, newInterval):
# Write your solution here
pass
class Solution {
public List<int[]> insert(List<int[]> intervals, int[] newInterval) {
// Write your solution here
return new ArrayList<>();
}
}
#include <vector>
using namespace std;
vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
// Write your solution here
return {};
}
function insert(intervals, newInterval) {
// Write your solution here
}
Common Bugs to Avoid
Wrong: [[1,3],[2,5],[6,9]]Fails to merge overlapping intervals; inserts newInterval without merging.✅ Merge intervals where intervals[i][0] <= newInterval[1] by updating newInterval boundaries.
Wrong: [[5,7]]Fails on empty intervals input; returns only newInterval but ignores empty list condition.✅ Return [newInterval] if intervals list is empty.
Wrong: [[1,2],[3,5],[6,7],[8,10],[12,16],[4,8]]Appends newInterval at end without merging overlapping intervals.✅ Merge all overlapping intervals before appending newInterval.
Wrong: [[1,2],[3,5],[6,7],[8,10],[12,16]]Fails to insert newInterval when it does not overlap any intervals.✅ Insert newInterval in correct position when no overlaps.
Wrong: [[1,2],[3,8],[12,16]]Stops merging after first overlap (greedy trap).✅ Continue merging while intervals overlap newInterval.