Add solution #1272

JoshCrozier · JoshCrozier · commit eb73a581f9bf · 2025-06-30T23:47:43.000-05:00
diff --git a/README.md b/README.md
@@ -1179,6 +1179,7 @@
 1268|[Search Suggestions System](./solutions/1268-search-suggestions-system.js)|Medium|
 1269|[Number of Ways to Stay in the Same Place After Some Steps](./solutions/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.js)|Hard|
 1271|[Hexspeak](./solutions/1271-hexspeak.js)|Easy|
+1272|[Remove Interval](./solutions/1272-remove-interval.js)|Medium|
 1275|[Find Winner on a Tic Tac Toe Game](./solutions/1275-find-winner-on-a-tic-tac-toe-game.js)|Easy|
 1276|[Number of Burgers with No Waste of Ingredients](./solutions/1276-number-of-burgers-with-no-waste-of-ingredients.js)|Medium|
 1277|[Count Square Submatrices with All Ones](./solutions/1277-count-square-submatrices-with-all-ones.js)|Medium|
diff --git a/solutions/1272-remove-interval.js b/solutions/1272-remove-interval.js
@@ -0,0 +1,43 @@
+/**
+ * 1272. Remove Interval
+ * https://leetcode.com/problems/remove-interval/
+ * Difficulty: Medium
+ *
+ * A set of real numbers can be represented as the union of several disjoint intervals,
+ * where each interval is in the form [a, b). A real number x is in the set if one of
+ * its intervals [a, b) contains x (i.e. a <= x < b).
+ *
+ * You are given a sorted list of disjoint intervals intervals representing a set of
+ * real numbers as described above, where intervals[i] = [ai, bi] represents the interval
+ * [ai, bi). You are also given another interval toBeRemoved.
+ *
+ * Return the set of real numbers with the interval toBeRemoved removed from intervals.
+ * In other words, return the set of real numbers such that every x in the set is in
+ * intervals but not in toBeRemoved. Your answer should be a sorted list of disjoint
+ * intervals as described above.
+ */
+
+/**
+ * @param {number[][]} intervals
+ * @param {number[]} toBeRemoved
+ * @return {number[][]}
+ */
+var removeInterval = function(intervals, toBeRemoved) {
+  const result = [];
+  const [removeStart, removeEnd] = toBeRemoved;
+
+  for (const [start, end] of intervals) {
+    if (end <= removeStart || start >= removeEnd) {
+      result.push([start, end]);
+    } else {
+      if (start < removeStart) {
+        result.push([start, removeStart]);
+      }
+      if (end > removeEnd) {
+        result.push([removeEnd, end]);
+      }
+    }
+  }
+
+  return result;
+};
