Add solution #1229

JoshCrozier · JoshCrozier · commit 67d6aa2ef3af · 2025-06-28T23:45:05.000-05:00
diff --git a/README.md b/README.md
@@ -1141,6 +1141,7 @@
 1224|[Maximum Equal Frequency](./solutions/1224-maximum-equal-frequency.js)|Hard|
 1227|[Airplane Seat Assignment Probability](./solutions/1227-airplane-seat-assignment-probability.js)|Medium|
 1228|[Missing Number In Arithmetic Progression](./solutions/1228-missing-number-in-arithmetic-progression.js)|Easy|
+1229|[Meeting Scheduler](./solutions/1229-meeting-scheduler.js)|Medium|
 1232|[Check If It Is a Straight Line](./solutions/1232-check-if-it-is-a-straight-line.js)|Easy|
 1233|[Remove Sub-Folders from the Filesystem](./solutions/1233-remove-sub-folders-from-the-filesystem.js)|Medium|
 1234|[Replace the Substring for Balanced String](./solutions/1234-replace-the-substring-for-balanced-string.js)|Medium|
diff --git a/solutions/1229-meeting-scheduler.js b/solutions/1229-meeting-scheduler.js
@@ -0,0 +1,49 @@
+/**
+ * 1229. Meeting Scheduler
+ * https://leetcode.com/problems/meeting-scheduler/
+ * Difficulty: Medium
+ *
+ * Given the availability time slots arrays slots1 and slots2 of two people and a meeting
+ * duration duration, return the earliest time slot that works for both of them and is of
+ * duration duration.
+ *
+ * If there is no common time slot that satisfies the requirements, return an empty array.
+ *
+ * The format of a time slot is an array of two elements [start, end] representing an
+ * inclusive time range from start to end.
+ *
+ * It is guaranteed that no two availability slots of the same person intersect with each
+ * other. That is, for any two time slots [start1, end1] and [start2, end2] of the same
+ * person, either start1 > end2 or start2 > end1.
+ */
+
+/**
+ * @param {number[][]} slots1
+ * @param {number[][]} slots2
+ * @param {number} duration
+ * @return {number[]}
+ */
+var minAvailableDuration = function(slots1, slots2, duration) {
+  slots1.sort((a, b) => a[0] - b[0]);
+  slots2.sort((a, b) => a[0] - b[0]);
+
+  let i = 0;
+  let j = 0;
+
+  while (i < slots1.length && j < slots2.length) {
+    const overlapStart = Math.max(slots1[i][0], slots2[j][0]);
+    const overlapEnd = Math.min(slots1[i][1], slots2[j][1]);
+
+    if (overlapEnd - overlapStart >= duration) {
+      return [overlapStart, overlapStart + duration];
+    }
+
+    if (slots1[i][1] < slots2[j][1]) {
+      i++;
+    } else {
+      j++;
+    }
+  }
+
+  return [];
+};
