Available question text
Given a tree-structured company hierarchy rooted at headID where each employee i takes informTime[i] minutes to notify its direct subordinates, compute the minimum time to inform all employees — equivalently the maximum accumulated informTime along any root-to-leaf path. n can be up to 1e5, so solve with a linear-time tree traversal (DFS/BFS) to accumulate max times.
Related questions
Continue with questions that share topics or the same question type.
- Solve this impossible leetcode hard problem that involves figuring out an alogrithms that can crack any RSA encryption in O(1) time.
All jokes aside, it was a question about topological sorting. You have to find manager and employees given a list of their names and ids and print them out in a pyramid sideway pyramid.
Coding
- Compute time to infect all cells
Coding · Graphs · Grids & Matrices
- Find Minimum Time to Finish All Jobs
Coding
- Find Minimum Time to Finish All Jobs II
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1376. Time Needed to Inform All Employees
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source