Create 1723-find-minimum-time-to-finish-all-jobs.js

Author: everthis

1723-find-minimum-time-to-finish-all-jobs.js

@@ -0,0 +1,47 @@
+/**
+ * @param {number[]} jobs
+ * @param {number} k
+ * @return {number}
+ */
+const minimumTimeRequired = function (jobs, k) {
+  if (jobs.length <= k) {
+    return Math.max(...jobs)
+  }
+
+  // create a store to hold the number of hours each worker worked
+  const workers = new Array(k).fill(0)
+
+  let minLongestWorkingTime = Infinity
+  const dfs = (i) => {
+    if (i === jobs.length) {
+      // if we assigned all the jobs, see if we have a better result
+      minLongestWorkingTime = Math.min(
+        minLongestWorkingTime,
+        Math.max(...workers)
+      )
+      return
+    }
+    const lengthOfWork = jobs[i]
+
+    for (let worker = 0; worker < k; worker++) {
+      workers[worker] += lengthOfWork
+
+      // if this combination is has a chance of decreasing our
+      // answer, try it, otherwise skip it to save on time.
+      if (workers[worker] <= minLongestWorkingTime) {
+        dfs(i + 1)
+      }
+      workers[worker] -= lengthOfWork
+
+      // We want to minimize the width of the tree
+      // so if the worker has gotten their first job
+      // don't try any workers after this worker.
+      // All other workers after this worker will be 0 as well
+      // so the combination is exactly the same.
+      if (workers[worker] === 0) break
+    }
+  }
+
+  dfs(0)
+  return minLongestWorkingTime
+}