Time needed to inform all employees

Tree Depth-First Search Breadth-First Search

60.4% acceptance

Feb 25, 2026

4248

323

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.

Solution

Rust

Time O(n * m)

Space O(n * m)

LeetCode

solution.rs

impl Solution {
  pub fn num_of_minutes(n: i32, head_id: i32, manager: Vec<i32>, inform_time: Vec<i32>) -> i32 {
    let n = n as usize;
    let mut children = vec![vec![]; n];
    for i in 0..n {
      if manager[i] != -1 {
        children[manager[i] as usize].push(i);
      }
    }
    fn dfs(node: usize, children: &Vec<Vec<usize>>, inform_time: &Vec<i32>) -> i32 {
      let mut max_child = 0;
      for &c in &children[node] {
        max_child = max_child.max(dfs(c, children, inform_time));
      }
      inform_time[node] + max_child
    }
    dfs(head_id as usize, &children, &inform_time)
  }
}