Available question text
Given a weighted undirected graph of n cities, compute for each city how many other cities are reachable within a given distanceThreshold via shortest paths, and return the city with the smallest such count (breaking ties by largest index). This is essentially an all-pairs shortest-path/counting problem on a small graph (n ≤ 100).
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source