Remove-Covered-Intervals.cpp (#163)

* improved c++ code

* Improved code with O(nlogn) solution

Co-authored-by: Gourav Rusiya <[email protected]>

Author: garvitdoda1266

C++/Remove-Covered-Intervals.cpp

@@ -27,3 +27,32 @@ class Solution {
 };
 
 //Complexity: O(n*n)
+
+
+
+SIMPLIFIED SOLUTION in O(nlogn) time
+
+//
+class Solution {
+public:
+    int removeCoveredIntervals(vector<vector<int>>& intervals) {
+        sort(intervals.begin(),intervals.end(),[](vector<int>& v1,vector<int>& v2){
+            if(v1[0]==v2[0])
+                return v1[1]>v2[1];
+            return v1[0]<v2[0];
+        });
+        int end = intervals[0][1];
+        int sz = 1;
+        for(int i=1;i<intervals.size();i++)
+        {
+            if(intervals[i][1]>end)
+            {
+                end = intervals[i][1];
+                sz++;
+            }
+        }
+        return sz;
+    }
+};
+
+//