Available question text
Given a functional directed graph defined by receiver (each node points to one node), choose a start index to maximize the sum of visited node indices after k passes; the core challenge is efficiently handling long walks that traverse tails into cycles and accumulating sums for very large k (n ≤ 1e5, k ≤ 1e10).
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 2836. Maximize Value of Function in a Ball Passing Game
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source