1986. Minimum Number of Work Sessions to Finish the Tasks: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1497,3 +1497,4 @@ mod s1981_minimize_the_difference_between_target_and_chosen_elements;
 mod s1982_find_array_given_subset_sums;
 mod s1984_minimum_difference_between_highest_and_lowest_of_k_scores;
 mod s1985_find_the_kth_largest_integer_in_the_array;
+mod s1986_minimum_number_of_work_sessions_to_finish_the_tasks;

src/solution/s1986_minimum_number_of_work_sessions_to_finish_the_tasks.rs

@@ -0,0 +1,96 @@
+/**
+ * [1986] Minimum Number of Work Sessions to Finish the Tasks
+ *
+ * There are n tasks assigned to you. The task times are represented as an integer array tasks of length n, where the i^th task takes tasks[i] hours to finish. A work session is when you work for at most sessionTime consecutive hours and then take a break.
+ * You should finish the given tasks in a way that satisfies the following conditions:
+ *
+ * 	If you start a task in a work session, you must complete it in the same work session.
+ * 	You can start a new task immediately after finishing the previous one.
+ * 	You may complete the tasks in any order.
+ *
+ * Given tasks and sessionTime, return the minimum number of work sessions needed to finish all the tasks following the conditions above.
+ * The tests are generated such that sessionTime is greater than or equal to the maximum element in tasks[i].
+ *  
+ * Example 1:
+ *
+ * Input: tasks = [1,2,3], sessionTime = 3
+ * Output: 2
+ * Explanation: You can finish the tasks in two work sessions.
+ * - First work session: finish the first and the second tasks in 1 + 2 = 3 hours.
+ * - Second work session: finish the third task in 3 hours.
+ *
+ * Example 2:
+ *
+ * Input: tasks = [3,1,3,1,1], sessionTime = 8
+ * Output: 2
+ * Explanation: You can finish the tasks in two work sessions.
+ * - First work session: finish all the tasks except the last one in 3 + 1 + 3 + 1 = 8 hours.
+ * - Second work session: finish the last task in 1 hour.
+ *
+ * Example 3:
+ *
+ * Input: tasks = [1,2,3,4,5], sessionTime = 15
+ * Output: 1
+ * Explanation: You can finish all the tasks in one work session.
+ *
+ *  
+ * Constraints:
+ *
+ * 	n == tasks.length
+ * 	1 <= n <= 14
+ * 	1 <= tasks[i] <= 10
+ * 	max(tasks[i]) <= sessionTime <= 15
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks/
+// discuss: https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn min_sessions(tasks: Vec<i32>, session_time: i32) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1986_example_1() {
+        let tasks = vec![1, 2, 3];
+        let session_time = 3;
+
+        let result = 2;
+
+        assert_eq!(Solution::min_sessions(tasks, session_time), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1986_example_2() {
+        let tasks = vec![3, 1, 3, 1, 1];
+        let session_time = 8;
+
+        let result = 2;
+
+        assert_eq!(Solution::min_sessions(tasks, session_time), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1986_example_3() {
+        let tasks = vec![1, 2, 3, 4, 5];
+        let session_time = 15;
+
+        let result = 1;
+
+        assert_eq!(Solution::min_sessions(tasks, session_time), result);
+    }
+}