##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Merge with new interval
Given a sorted list of non-overlapping intervals and a new interval, insert the new interval and merge if necessary. Return the result still sorted and non-overlapping.
Example: intervals , new returns . This builds on merge intervals but requires handling the insertion point. Constraints: up to intervals.
