[Python] Very simple solution based on merge intervals
\nclass Solution:\n    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:\n        ## RC ##\n\t\t## Similar to Leetcode 56
```\nclass Solution:\n    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:\n        ## RC ##\n\t\t## Similar to Leetcode 56. Merge Intervals ##\n\t\t## LOGIC ##\n\t\t## 1. As per the problem statement, the intervals are initially sorted, so we donot need to sort them, we can just insert the new interval in the right position and apply the merge intervals algorithm. ##\n\t\t## TIME COMPLEXICITY : O(N) ##\n\t\t## SPACE COMPLEXICITY : O(1) ##\n        \n        i = 0\n        while( i<len(intervals) and intervals[i][0] < newInterval[0]):\n            i+= 1\n        \n        intervals.insert(i,newInterval)\n        \n        ans = []\n        for interval in intervals:\n            if len(ans) == 0 or ans[-1][1] < interval[0]:\n                ans.append(interval)\n            else:\n                ans[-1][1] = max(ans[-1][1], interval[1])\n        return ans\n```
['Python', 'Python3']