add cpp solution #1288 (#91)

Author: verma-anushka

C++/Remove-Covered-Intervals.cpp

@@ -0,0 +1,29 @@
+//Problem Statement: Remove Covered Intervals
+
+// Given a list of intervals, remove all intervals that are covered by another interval in the list.
+
+// Interval [a,b) is covered by interval [c,d) if and only if c <= a and b <= d.
+
+// After doing so, return the number of remaining intervals.
+
+//Solution:
+class Solution {
+public:
+ int removeCoveredIntervals(vector<vector<int>>& intervals) {
+ 
+ int ans=0;
+ for(int i=0; i<intervals.size(); i++) {
+ for(int j=0; j<intervals.size(); j++) {
+ if(i==j) continue;
+ if(intervals[i][0] >= intervals[j][0] && intervals[i][1] <= intervals[j][1]) {
+ // cout << i << endl;
+ ans++; break;
+ }
+ }
+ }
+ 
+ return intervals.size()-ans;
+ }
+};
+
+//Complexity: O(n*n)

README.md

@@ -106,6 +106,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | [C++](./C++/k-diff-pairs-in-an-array.cpp) | O(n) | O(n) | Medium | Array |
 | 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [Javascript](./JavaScript/152.Maximum-Product-Subarray.js) | O(n) | O(n) | Medium | Array |
 | 073 | [Set-Matrix-Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Java](./Java/set-matrix-zeroes.java) | O(MN) | O(1) | Medium | Array |
+| 1288 | [Remove-Covered-Intervals](https://leetcode.com/problems/remove-covered-intervals) | [C++](./C++/Remove-Covered-Intervals.cpp) | O(N*N) | O(1) | Medium | Array |
 
 <br/>
 <div align="right">