From 4c12c84346c8dfe8c28ac5f68ed587d77c14ac8a Mon Sep 17 00:00:00 2001
From: Praddyumn Shukla <spraddyumn@gmail.com>
Date: Thu, 1 Oct 2020 19:33:50 +0530
Subject: [PATCH] Create
 leetcode.com-explore-challenge-card-september-leetcoding-challenge-555-week-2-september-8th-september-14th-3458

C++ Solution to "Insert Interval" Problem in September Leetcoding Challenge of Week 2
---
 ...5-week-2-september-8th-september-14th-3458 | 24 +++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 leetcode.com-explore-challenge-card-september-leetcoding-challenge-555-week-2-september-8th-september-14th-3458

diff --git a/leetcode.com-explore-challenge-card-september-leetcoding-challenge-555-week-2-september-8th-september-14th-3458 b/leetcode.com-explore-challenge-card-september-leetcoding-challenge-555-week-2-september-8th-september-14th-3458
new file mode 100644
index 0000000..62cf206
--- /dev/null
+++ b/leetcode.com-explore-challenge-card-september-leetcoding-challenge-555-week-2-september-8th-september-14th-3458
@@ -0,0 +1,24 @@
+class Solution {
+public:
+    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
+        
+        vector<vector<int>> result;
+        int i = 0 , n = intervals.size();
+        
+        while(i < n && intervals[i][1] < newInterval[0]) result.push_back(intervals[i++]);
+        
+        vector<int> mi = newInterval;
+        while(i < n && intervals[i][0] <= newInterval[1]){
+            mi[0] = min(mi[0] , intervals[i][0]);
+            mi[1] = max(mi[1] , intervals[i++][1]);
+        }
+        
+        result.push_back(mi);
+        
+        while(i < n ) result.push_back(intervals[i++]);
+        
+        return result;
+    }
+};
+
+