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 2065. Maximum Path Quality of a Graph

Find the maximum sum of unique node values collectible by any walk that starts and ends at node 0 within a given time budget on a weighted undirected graph — you may revisit nodes but each node's value is counted at most once. The core challenge is exploring time-constrained walks (maxTime ≤ 100 and node degree ≤ 4) to maximize unique-node coverage under travel-cost limits.

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

Mid-level

Find the maximum quality for given input stream/list over N channels

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 2065. Maximum Path Quality of a Graph

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact