Go O(ln(n)) O(1) beats 100%
\nfunc insert(intervals [][]int, new []int) [][]int {\n    n := len(intervals)\n    i := sort.Search(n, func(i int) bool { return intervals[i][0] > new[0] })\n 
```\nfunc insert(intervals [][]int, new []int) [][]int {\n    n := len(intervals)\n    i := sort.Search(n, func(i int) bool { return intervals[i][0] > new[0] })\n    j := sort.Search(n, func(j int) bool { return intervals[j][1] > new[1] })\n    if i >= 1 && new[0] <= intervals[i-1][1] {\n        new[0] = intervals[i-1][0]\n        i--\n    }\n    if j < n && new[1] >= intervals[j][0] {\n        new[1] = intervals[j][1]\n        j++\n    }\n    return append(intervals[:i], append([][]int{new}, intervals[j:]...)...)\n}\n```
['Binary Search', 'Go']