Minimum Score of a Path Between Two Cities
Problem Statement:-
You are given a positive integer n representing n cities numbered from 1 to n. You are also given a 2D array roads where roads[i] = [a<sub>i</sub>, b<sub>i</sub>, distance<sub>i</sub>] indicates that there is a bidirectional road ...
techie-sagar.hashnode.dev5 min read