dnshi
diff --git a/‎README.md
Lines changed: 1 addition & 0 deletions b/‎README.md
Lines changed: 1 addition & 0 deletions
diff --git a/‎algorithms/RemoveCoveredIntervals.js
Lines changed: 59 additions & 0 deletions b/‎algorithms/RemoveCoveredIntervals.js
Lines changed: 59 additions & 0 deletions
@@ -13,6 +13,7 @@
 |1379|[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree)|[JavaScript](algorithms/FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree.js)|Medium|
 |1344|[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock)|[JavaScript](algorithms/AngleBetweenHandsOfAClock.js)|Medium|
 |1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer)|[JavaScript](algorithms/ConvertBinaryNumberInALinkedListToInteger.js)|Easy|
+|1288|[Remove Covered Intervals](https://leetcode.com/problems/remove-covered-intervals)|[JavaScript](algorithms/RemoveCoveredIntervals.js)|Medium|
 |1071|[Greatest 
10000
Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings)|[JavaScript](algorithms/GreatestCommonDivisorOfStrings.js)|Easy|
 |1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)|[JavaScript](algorithms/RemoveAllAdjacentDuplicatesInString.js)|Easy|
 |1046|[Last Stone Weight](https://leetcode.com/problems/last-stone-weight)|[JavaScript](algorithms/LastStoneWeight.js)|Easy|
 
@@ -0,0 +1,59 @@
+// Source : https://leetcode.com/problems/remove-covered-intervals
+// Author : Dean Shi
+// Date   : 2022-01-07
+
+/***************************************************************************************
+ * Given an array intervals where intervals[i] = [li, ri] represent the interval [li,
+ * ri), remove all intervals that are covered by another interval in the list.
+ * 
+ * The interval [a, b) is covered by the interval [c, d) if and only if c <= a and b <=
+ * d.
+ * 
+ * Return the number of remaining intervals.
+ * 
+ * Example 1:
+ * 
+ * Input: intervals = [[1,4],[3,6],[2,8]]
+ * Output: 2
+ * Explanation: Interval [3,6] is covered by [2,8], therefore it is removed.
+ * 
+ * Example 2:
+ * 
+ * Input: intervals = [[1,4],[2,3]]
+ * Output: 1
+ * 
+ * Constraints:
+ * 
+ * 1 <= intervals.length <= 1000
+ * intervals[i].length == 2
+ * 0 <= li <= ri <= 105
+ * All the given intervals are unique.
+ * 
+ * 
+ ***************************************************************************************/
+
+/**
+ * @param {number[][]} intervals
+ * @return {number}
+ */
+var removeCoveredIntervals = function(intervals) {
+    intervals.sort((a, b) => a[0] - b[0])
+
+    let count = intervals.length
+    let prevInterval = intervals[0]
+
+    for (let i = 1; i < intervals.length; i++) {
+        const currInterval = intervals[i]
+        if (prevInterval[1] >= currInterval[1]) {
+            count -= 1
+            continue
+        } else if (
+            prevInterval[1] < currInterval[1] &&
+            prevInterval[0] === currInterval[0]
+        ) {
+            count -= 1
+        }
+        prevInterval = currInterval
+    }
+    return count
+};