<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>

// Jai Shree Ram, Jai Hanuman Ji
// 13 Sep 2024
// Started: 06:08PM
// Submitted: 06:45PM
class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        vector<vector<int>> newIntervals;
        int n = intervals.size();
        int i = 0;
        bool flag = false;
        for(; i < n ; i ++) {
            if(newInterval[1] < intervals[i][0]) { // end of New Interval < start of current Interval
                newIntervals.push_back(newInterval);
                flag = true;
                break;
            }
            if(newInterval[0] <= intervals[i][1]) {   // start of New Interval <= end of current Interval
                int start = min(intervals[i][0], newInterval[0]);
                if(newInterval[1] <= intervals[i][1]) { // end of New Interval <= end of current Interval
                    vector<int> temp{start,intervals[i][1]};
                    newIntervals.push_back(temp);
                    flag = true;
                    i ++;
                    break;
                } else {
                    i ++;
                    int end = newInterval[1];
                    while(i < n) {
                        if(intervals[i][0] > end) { // start of current interval > end
                            vector<int> temp{start,end};
                            newIntervals.push_back(temp);
                            flag = true;
                            break;
                        } 
                        if(intervals[i][1] >= end) { // end of current interval >= end
                            vector<int> temp{start,intervals[i][1]};
                            newIntervals.push_back(temp);
                            flag = true;
                            i ++;
                            break;
                        }
                        i ++;
                    }
                    if(!flag) {
                        vector<int> temp{start,end};
                        newIntervals.push_back(temp);
                        flag = true;
                    }
                    break;
                }
            } 
            newIntervals.push_back(intervals[i]);
        }
        if(!flag) {
            newIntervals.push_back(newInterval);
        }
        while(i < n){
            newIntervals.push_back(intervals[i]);
            i ++;
        }
        return newIntervals;
    }
};
21000