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.
Return the 3n+1 sequence for n
4894 Solvers
Project Euler: Problem 10, Sum of Primes
514 Solvers
Rotate input square matrix 90 degrees CCW without rot90
250 Solvers
Sum the elements in either diagonal of a square matrix
139 Solvers
27 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.