Add solution #1376

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,262 LeetCode solutions in JavaScript
+# 1,263 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1048,6 +1048,7 @@
 1373|[Maximum Sum BST in Binary Tree](./solutions/1373-maximum-sum-bst-in-binary-tree.js)|Hard|
 1374|[Generate a String With Characters That Have Odd Counts](./solutions/1374-generate-a-string-with-characters-that-have-odd-counts.js)|Easy|
 1375|[Number of Times Binary String Is Prefix-Aligned](./solutions/1375-number-of-times-binary-string-is-prefix-aligned.js)|Medium|
+1376|[Time Needed to Inform All Employees](./solutions/1376-time-needed-to-inform-all-employees.js)|Medium|
 1380|[Lucky Numbers in a Matrix](./solutions/1380-lucky-numbers-in-a-matrix.js)|Easy|
 1389|[Create Target Array in the Given Order](./solutions/1389-create-target-array-in-the-given-order.js)|Easy|
 1400|[Construct K Palindrome Strings](./solutions/1400-construct-k-palindrome-strings.js)|Medium|

solutions/1376-time-needed-to-inform-all-employees.js

@@ -0,0 +1,50 @@
+/**
+ * 1376. Time Needed to Inform All Employees
+ * https://leetcode.com/problems/time-needed-to-inform-all-employees/
+ * Difficulty: Medium
+ *
+ * A company has n employees with a unique ID for each employee from 0 to n - 1. The head
+ * of the company is the one with headID.
+ *
+ * Each employee has one direct manager given in the manager array where manager[i] is the
+ * direct manager of the i-th employee, manager[headID] = -1. Also, it is guaranteed that
+ * the subordination relationships have a tree structure.
+ *
+ * The head of the company wants to inform all the company employees of an urgent piece of
+ * news. He will inform his direct subordinates, and they will inform their subordinates,
+ * and so on until all employees know about the urgent news.
+ *
+ * The i-th employee needs informTime[i] minutes to inform all of his direct subordinates
+ * (i.e., After informTime[i] minutes, all his direct subordinates can start spreading the news).
+ *
+ * Return the number of minutes needed to inform all the employees about the urgent news.
+ */
+
+/**
+ * @param {number} n
+ * @param {number} headID
+ * @param {number[]} manager
+ * @param {number[]} informTime
+ * @return {number}
+ */
+var numOfMinutes = function(n, headID, manager, informTime) {
+  const adjacencyList = Array.from({ length: n }, () => []);
+
+  for (let i = 0; i < n; i++) {
+    if (manager[i] !== -1) {
+      adjacencyList[manager[i]].push(i);
+    }
+  }
+
+  return calculateTime(headID);
+
+  function calculateTime(employee) {
+    let maxSubordinateTime = 0;
+
+    for (const subordinate of adjacencyList[employee]) {
+      maxSubordinateTime = Math.max(maxSubordinateTime, calculateTime(subordinate));
+    }
+
+    return informTime[employee] + maxSubordinateTime;
+  }
+};