LeetCode 1334 Find the City - Breaking Down the Problem

Find the City has two steps: Step $1$: Compute all-pairs shortest paths using Floyd-Warshall. Step $2$: For each city $i$, count how many cities $j$ satisfy dist[i][j] <= threshold (excluding $i$ itself). Return the city with the minimum count.

Ties go to the larger city number. The Floyd-Warshall step is standard. The counting step is a simple loop over the distance matrix. This two-step pattern is common in graph problems.