Cody

Problem 1049. Path of least resistance

Find the length of the shortest path through the matrix from the top left to bottom right corner. You may move right, down, or diagonally right-down one element at a time. The length of the path is the sum of the elements you pass through.

E.g.

 M = [*8      6      10      10     4     7     7      7
       9     *1      10      5      9     0     8      2
       1      3     *2       8      8     8     7      7
       9      5      10     *1     *10   *9    *4     *0 ]; 
>> shortest_path(M)

ans =

      35

The shortest path through this matrix has length 35. Each element along the path is marked with a *

Solve

Solution Stats

59.8% Correct | 40.2% Incorrect
Last solution submitted on Oct 06, 2019

Problem Comments

Solution Comments

Problem Recent Solvers37

Suggested Problems

More from this Author5

Problem Tags

dynamic-programming