Problem - https://www.geeksforgeeks.org/problem...

There are n cities labeled from 0 to n-1 with m edges connecting them. Given the array edges where edges[i] = [fromi , toi ,weighti] represents a bidirectional and weighted edge between cities fromi and toi, and given the integer distanceThreshold. You need to find out a city with the smallest number of cities that are reachable through some path and whose distance is at most Threshold Distance. If there are multiple such cities, our answer will be the city with the greatest label.

Note: The distance of a path connecting cities i and j is equal to the sum of the edge's weights along that path.

Example 1:

Input:
n = 4, m = 4
edges = [[0, 1, 3],
[1, 2, 1],
[1, 3, 4],
[2, 3, 1]]
distanceThreshold = 4
Output:
3
Explaination:

The neighboring cities at a distanceThreshold = 4 for each city are:
City 0 - [City 1, City 2]
City 1 - [City 0, City 2, City 3]
City 2 - [City 0, City 1, City 3]
City 3 - [City 1, City 2]
Cities 0 and 3 have 2 neighboring cities at a distanceThreshold = 4, but we have to return city 3 since it has the greatest number.
Example 2:

Input:
n = 5, m = 5
edges = [[0, 1, 2],
[0, 4, 8],
[1, 2, 3],
[1, 4, 2],
[2, 3, 1],
[3, 4, 1]]
distanceThreshold = 2.
Output:
0
Explaination:

The neighboring cities at a distanceThreshold = 2 for each city are:
City 0 - [City 1]
City 1 - [City 0, City 4]
City 2 - [City 3, City 4]
City 3 - [City 2, City 4]
City 4 - [City 1, City 2, City 3]
The city 0 has 1 neighboring city at a distanceThreshold = 2