//Given a set of non-overlapping & sorted intervals //insert a new interval into the intervals (merge if necessary). //Special Java solution (Interval class) public ArrayList insert(ArrayList intervals, Interval newInterval) { ArrayList result = new ArrayList(); for(Interval interval: intervals){ if(interval.end newInterval.end){ result.add(newInterval); newInterval = interval; }else if(interval.end >= newInterval.start || interval.start