Available question text
Given a directed functional graph (each node has exactly one outgoing edge via edges[i]), compute each node's "edge score" as the sum of labels of nodes that point to it and return the node with the highest score, breaking ties by smallest index. Constraint: n up to 1e5.
Related questions
Continue with questions that share topics or the same question type.
- All Divisions With the Highest Score of a Binary Array
Coding
- Count Nodes With the Highest Score
Coding
- Maximum Score of a Node Sequence
Coding
- Minimum Edge Reversals So Every Node Is Reachable
Coding · Breadth-First Search · Depth-First Search · Dynamic Programming
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
Amazon
Leetcode 2374. Node With Highest Edge Score
Reported Nov 12, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source