Available question text
Given a directed graph where an edge A→B means A influences B, compute for each salesperson how many others they can influence directly or transitively. The challenge is efficiently computing reachability/influence for all nodes in the presence of cycles and large networks (requiring graph compression or other scalable reachability techniques).
Related questions
Continue with questions that share topics or the same question type.
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 2372. Calculate the Influence of Each Salesperson
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source