251st Commit

README.md

@@ -280,10 +280,12 @@ Ace Coding Interview with 75 Qs
 [208]: ./src/page-2/208.%20Implement%20Trie%20(Prefix%20Tree)/Trie.ts
 [1268]: ./src/page-12/1268.%20Search%20Suggestions%20System/suggestedProducts.ts
 
-| Intervals                                       |          |        |
-| ----------------------------------------------- | -------- | ------ |
-| 435. Non-overlapping Intervals                  | Solution | Medium |
-| 452. Minimum Number of Arrows to Burst Balloons | Solution | Medium |
+| Intervals                                       |                 |        |
+| ----------------------------------------------- | --------------- | ------ |
+| 435. Non-overlapping Intervals                  | [Solution][435] | Medium |
+| 452. Minimum Number of Arrows to Burst Balloons | Solution        | Medium |
+
+[435]: ./src/page-5/435.%20Non-overlapping%20Intervals/eraseOverlapIntervals.ts
 
 | Monotonic Stack         |          |        |
 | ----------------------- | -------- | ------ |

src/page-5/435. Non-overlapping Intervals/eraseOverlapIntervals.test.ts

@@ -0,0 +1,29 @@
+import { eraseOverlapIntervals } from './eraseOverlapIntervals';
+
+describe('435. Non-overlapping Intervals', () => {
+  test('eraseOverlapIntervals', () => {
+    expect(
+      eraseOverlapIntervals([
+        [1, 2],
+        [2, 3],
+        [3, 4],
+        [1, 3],
+      ]),
+    ).toBe(1);
+
+    expect(
+      eraseOverlapIntervals([
+        [1, 2],
+        [1, 2],
+        [1, 2],
+      ]),
+    ).toBe(2);
+
+    expect(
+      eraseOverlapIntervals([
+        [1, 2],
+        [2, 3],
+      ]),
+    ).toBe(0);
+  });
+});

src/page-5/435. Non-overlapping Intervals/eraseOverlapIntervals.ts

@@ -0,0 +1,28 @@
+type EraseOverlapIntervals = (intervals: number[][]) => number;
+
+/**
+ * Accepted
+ */
+export const eraseOverlapIntervals: EraseOverlapIntervals = (intervals) => {
+  // Step 1: Sort intervals by end time
+  intervals.sort((a, b) => a[1] - b[1]);
+
+  let removalCount = 0;
+  let prevEnd = intervals[0][1]; // Initialize with the end time of the first interval
+
+  // Step 2: Traverse the sorted intervals starting from the second interval
+  for (let i = 1; i < intervals.length; i++) {
+    const [start, end] = intervals[i];
+
+    // Step 3: Check for overlap
+    if (start < prevEnd) {
+      // Overlapping interval found, increment removal count
+      removalCount += 1;
+    } else {
+      // Update `prevEnd` to the end of the current interval if there's no overlap
+      prevEnd = end;
+    }
+  }
+
+  return removalCount;
+};