# Find The City With The Smallest Number Of Neighbors: Study Guide

Find The City With The Smallest Number Of Neighbors shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Floyd-Warshall (or n Dijkstras) for all-pairs distances, then count how many cities sit within distance threshold of each city and pick the smallest count (tie: largest 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 (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^3).

## Common mistake

Counting only direct neighbors and ignoring multi-hop cities inside the threshold.

## 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 AI coding interview assistant.