Hard Problem? C++ Easy Solution
Not sure why this problem is marked as Hard, it\'s on the \'easy\' side of Easy.\ncpp\nvector<vector<int>> insert(vector<vector<int>>& ints, vector<int>& ni, in
Not sure why this problem is marked as Hard, it\'s on the \'easy\' side of Easy.\n```cpp\nvector<vector<int>> insert(vector<vector<int>>& ints, vector<int>& ni, int i = 0) {\n    vector<vector<int>> res;\n    for (; i < ints.size() && ints[i][0] <= ni[1]; ++i) {\n        if (ints[i][1] < ni[0])\n            res.push_back(ints[i]);\n        else {\n            ni[0] = min(ni[0], ints[i][0]);\n            ni[1] = max(ni[1], ints[i][1]);\n        }\n    }\n    res.push_back(ni);\n    res.insert(end(res), begin(ints) + i, end(ints));\n    return res;\n}\n```
[]