<p>You are given an array of non-overlapping intervals <code>intervals</code> where <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> represent the start and the end of the <code>i<sup>th</sup></code> interval and <code>intervals</code> is sorted in ascending order by <code>start<sub>i</sub></code>. You are also given an interval <code>newInterval = [start, end]</code> that represents the start and end of another interval.</p>

<p>Insert <code>newInterval</code> into <code>intervals</code> such that <code>intervals</code> is still sorted in ascending order by <code>start<sub>i</sub></code> and <code>intervals</code> still does not have any overlapping intervals (merge overlapping intervals if necessary).</p>

<p>Return <code>intervals</code><em> after the insertion</em>.</p>

<p><strong>Note</strong> that you don&#39;t need to modify <code>intervals</code> in-place. You can make a new array and return it.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> intervals = [[1,3],[6,9]], newInterval = [2,5]
<strong>Output:</strong> [[1,5],[6,9]]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
<strong>Output:</strong> [[1,2],[3,10],[12,16]]
<strong>Explanation:</strong> Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= intervals.length &lt;= 10<sup>4</sup></code></li>
	<li><code>intervals[i].length == 2</code></li>
	<li><code>0 &lt;= start<sub>i</sub> &lt;= end<sub>i</sub> &lt;= 10<sup>5</sup></code></li>
	<li><code>intervals</code> is sorted by <code>start<sub>i</sub></code> in <strong>ascending</strong> order.</li>
	<li><code>newInterval.length == 2</code></li>
	<li><code>0 &lt;= start &lt;= end &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        def overlaps(inta, intb):
            if intb[0] > inta[1]:
                return False
            if intb[1] < inta[0]:
                return False
            return True
        if not intervals:
            return [newInterval]
        
        if not any([overlaps(a, newInterval) for a in intervals]):
            revised_intervals = []
            i = 0
            while i < len(intervals) and intervals[i][0] < newInterval[1]:
                i += 1
            return intervals[:i] + [newInterval] + intervals[i:]

        revised_intervals = []
        i = 0
        while i < len(intervals):
            inta = intervals[i]
            if not overlaps(inta, newInterval):
                revised_intervals.append(inta)
                i += 1
            else:
                lbounds = []
                ubounds = []
                while i < len(intervals) and overlaps(intervals[i], newInterval):
                    lbounds.append(intervals[i][0])
                    ubounds.append(intervals[i][1])
                    i += 1
                newl = min(min(lbounds), newInterval[0])
                newu = max(max(ubounds), newInterval[1])
                revised_intervals.append([newl, newu])

        return revised_intervals
19500