# Find The City With The Smallest Number Of Neighbors At A Threshold Distance: Study Guide
Find The City With The Smallest Number Of Neighbors At A Threshold Distance shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
n cities with weighted edges. Floyd-Warshall (or n Dijkstras) gives all-pairs distances; count, for each city, how many others are within distanceThreshold; pick the smallest count, breaking ties toward the larger city id.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n^3).
## Common mistake
Using hop count instead of weighted distance, or breaking ties toward the smaller id.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at interview copilot app.