Add solution #3169

Author: JoshCrozier

README.md

@@ -995,6 +995,7 @@
 3110|[Score of a String](./solutions/3110-score-of-a-string.js)|Easy|
 3151|[Special Array I](./solutions/3151-special-array-i.js)|Easy|
 3160|[Find the Number of Distinct Colors Among the Balls](./solutions/3160-find-the-number-of-distinct-colors-among-the-balls.js)|Medium|
+3169|[Count Days Without Meetings](./solutions/3169-count-days-without-meetings.js)|Medium|
 3174|[Clear Digits](./solutions/3174-clear-digits.js)|Easy|
 3191|[Minimum Operations to Make Binary Array Elements Equal to One I](./solutions/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i.js)|Medium|
 3208|[Alternating Groups II](./solutions/3208-alternating-groups-ii.js)|Medium|

solutions/3169-count-days-without-meetings.js

@@ -0,0 +1,39 @@
+/**
+ * 3169. Count Days Without Meetings
+ * https://leetcode.com/problems/count-days-without-meetings/
+ * Difficulty: Medium
+ *
+ * You are given a positive integer days representing the total number of days an employee is
+ * available for work (starting from day 1). You are also given a 2D array meetings of size n
+ * where, meetings[i] = [start_i, end_i] represents the starting and ending days of meeting
+ * i (inclusive).
+ *
+ * Return the count of days when the employee is available for work but no meetings are scheduled.
+ *
+ * Note: The meetings may overlap.
+ */
+
+/**
+ * @param {number} days
+ * @param {number[][]} meetings
+ * @return {number}
+ */
+var countDays = function(days, meetings) {
+  meetings.sort((a, b) => a[0] - b[0]);
+
+  let result = 0;
+  let currentEnd = 0;
+
+  for (const [start, end] of meetings) {
+    if (start > currentEnd + 1) {
+      result += start - currentEnd - 1;
+    }
+    currentEnd = Math.max(currentEnd, end);
+  }
+
+  if (currentEnd < days) {
+    result += days - currentEnd;
+  }
+
+  return result;
+};