🔥 Day 4

Author: AkashRajpurohit

README.md

@@ -9,6 +9,7 @@
 1. [Number of Recent Calls](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3480/) ➡️ [CPP Solution](Week1/RecentCounter.cpp)
 2. [Combination Sum](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3481/) ➡️ [CPP Solution](Week1/combinationSum.cpp)
 3. [K-diff Pairs in an Array](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3482/) ➡️ [CPP Solution](Week1/findPairs.cpp)
+4. [Remove Covered Intervals](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3482/) ➡️ [CPP Solution](Week1/removeCoveredIntervals.cpp)
 
 ## Week 2 🚧
 

Week1/removeCoveredIntervals.cpp

@@ -0,0 +1,27 @@
+class Solution {
+public:
+    static bool compare(vector<int> i1, vector<int> i2) {
+        return i1[0] < i2[0];
+    }
+    
+    int removeCoveredIntervals(vector<vector<int>>& intervals) {
+        int count = 0;
+        int n = intervals.size();
+        
+        if(n <= 1) return n;
+        
+        sort(intervals.begin(), intervals.end(), compare);
+        vector<int> curr = {-1, -1};
+        
+        for(vector<int> in: intervals) {
+            if(in[0] > curr[0] && in[1] > curr[1]) {
+                count++;
+                curr[0] = in[0];
+            }
+            
+            curr[1] = max(curr[1], in[1]);
+        }
+        
+        return count;
+    }
+};