Non Overlapping Invervals solution

Author: PDKhan

non-overlapping-intervals/PDKhan.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
+        sort(intervals.begin(), intervals.end(), [](const vector<int>& a, const vector<int>& b){ return a[1] < b[1];});
+
+        int result = 0;
+        int end = intervals[0][1];
+
+        for(int i = 1; i < intervals.size(); i++){
+            if(intervals[i][0] < end)
+                result++;
+            else
+                end = intervals[i][1];
+        }
+
+        return result;
+    }
+};