1942. The Number of the Smallest Unoccupied Chair: RETRY

Author: tan-wei

Diff for: src/solution/mod.rs

@@ -1463,3 +1463,4 @@ mod s1936_add_minimum_number_of_rungs;
 mod s1937_maximum_number_of_points_with_cost;
 mod s1938_maximum_genetic_difference_query;
 mod s1941_check_if_all_characters_have_equal_number_of_occurrences;
+mod s1942_the_number_of_the_smallest_unoccupied_chair;

Diff for: src/solution/s1942_the_number_of_the_smallest_unoccupied_chair.rs

@@ -0,0 +1,88 @@
+/**
+ * [1942] The Number of the Smallest Unoccupied Chair
+ *
+ * There is a party where n friends numbered from 0 to n - 1 are attending. There is an infinite number of chairs in this party that are numbered from 0 to infinity. When a friend arrives at the party, they sit on the unoccupied chair with the smallest number.
+ *
+ * 	For example, if chairs 0, 1, and 5 are occupied when a friend comes, they will sit on chair number 2.
+ *
+ * When a friend leaves the party, their chair becomes unoccupied at the moment they leave. If another friend arrives at that same moment, they can sit in that chair.
+ * You are given a 0-indexed 2D integer array times where times[i] = [arrivali, leavingi], indicating the arrival and leaving times of the i^th friend respectively, and an integer targetFriend. All arrival times are distinct.
+ * Return the chair number that the friend numbered targetFriend will sit on.
+ *  
+ * Example 1:
+ *
+ * Input: times = [[1,4],[2,3],[4,6]], targetFriend = 1
+ * Output: 1
+ * Explanation:
+ * - Friend 0 arrives at time 1 and sits on chair 0.
+ * - Friend 1 arrives at time 2 and sits on chair 1.
+ * - Friend 1 leaves at time 3 and chair 1 becomes empty.
+ * - Friend 0 leaves at time 4 and chair 0 becomes empty.
+ * - Friend 2 arrives at time 4 and sits on chair 0.
+ * Since friend 1 sat on chair 1, we return 1.
+ *
+ * Example 2:
+ *
+ * Input: times = [[3,10],[1,5],[2,6]], targetFriend = 0
+ * Output: 2
+ * Explanation:
+ * - Friend 1 arrives at time 1 and sits on chair 0.
+ * - Friend 2 arrives at time 2 and sits on chair 1.
+ * - Friend 0 arrives at time 3 and sits on chair 2.
+ * - Friend 1 leaves at time 5 and chair 0 becomes empty.
+ * - Friend 2 leaves at time 6 and chair 1 becomes empty.
+ * - Friend 0 leaves at time 10 and chair 2 becomes empty.
+ * Since friend 0 sat on chair 2, we return 2.
+ *
+ *  
+ * Constraints:
+ *
+ * 	n == times.length
+ * 	2 <= n <= 10^4
+ * 	times[i].length == 2
+ * 	1 <= arrivali < leavingi <= 10^5
+ * 	0 <= targetFriend <= n - 1
+ * 	Each arrivali time is distinct.
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/
+// discuss: https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn smallest_chair(times: Vec<Vec<i32>>, target_friend: i32) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1942_example_1() {
+        let times = vec![vec![1, 4], vec![2, 3], vec![4, 6]];
+        let target_friend = 1;
+
+        let result = 1;
+
+        assert_eq!(Solution::smallest_chair(times, target_friend), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1942_example_2() {
+        let times = vec![vec![3, 10], vec![1, 5], vec![2, 6]];
+        let target_friend = 0;
+
+        let result = 2;
+
+        assert_eq!(Solution::smallest_chair(times, target_friend), result);
+    }
+}