LeetCode 1334 Find the City - Walkthrough

Sample: $n=4$, edges $= [(0,1,3), (1,2,1), (1,3,4), (2,3,1)]$, threshold $= 4$. After Floyd-Warshall: dist[0][1]=3, dist[0][2]=4, dist[0][3]=5, etc. City $0$ reaches cities $1$ and $2$ (count $= 2$). City $3$ reaches cities $1$ and $2$ (count $= 2$).

Tied at $2$. Return city $3$ (larger index). This example shows how ties are resolved by returning the higher-numbered city. The tie-breaking rule is part of the problem statement.