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 2492. Minimum Score of a Path Between Two Cities

Given an undirected weighted graph, find the minimum possible path score between city 1 and city n, where a path's score is the smallest edge weight along that path. This reduces to finding the connected component containing 1 and n and returning the minimum edge weight inside that component (use BFS/DFS or Union-Find to identify the component).

Asked at:

Amazon

Question Timeline

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

Company

Level

Region

Early February, 2025

Amazon

Mid-level

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 2492. Minimum Score of a Path Between Two Cities

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact