30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 2374. Node With Highest Edge Score

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.

Asked at:

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid November, 2024

Amazon

Junior

Directed Graph Edge Score: Find the node with the highest edge score in a directed graph. If there's a tie, return the smallest indexed node.

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2374. Node With Highest Edge Score

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact