Given a matrix that represent the distance along highways between major cities numbered 1 to N, provide the path and shortest distance from a given city, from, to a given city, to. Assume that 0 represents no direct path between two cities. If there is no solution to the problem, return -1 for both the path and the distance.
Swap the first and last columns
9118 Solvers
Find state names that start with the letter N
427 Solvers
Implement simple rotation cypher
768 Solvers
55 Solvers
179 Solvers
Solution 57507
something strange with test cases 22, 23, and 25, the solution provided does not look like the shortest path (e.g. test case 22; the path 23-7-24-4-14 is shorter than the solution path 23-7-14), perhaps your solver is assuming triangular property of distances while the data provided does not have this property?
i'll look into it
I agree with you. i'm ammending my test cases now.