Quick Overview

Find the minimum edge score achievable on a route between two cities in a large undirected road network, where revisiting cities and roads is allowed. The problem tests graph-component reasoning, traversal at scale, careful interpretation of a path score, and resistance to applying a standard shortest-path metric blindly.

Find the Minimum Edge Score on a Path Between Two Cities

Company: Visa

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Online Assessment

Overview: Find the minimum edge score achievable on a route between two cities in a large undirected road network, where revisiting cities and roads is allowed. The problem tests graph-component reasoning, traversal at scale, careful interpretation of a path score, and resistance to applying a standard shortest-path metric blindly.

Loading…