Problem 45457. Minimal Path - 02

Created by Asif Newaz
Appears in Cody Problems in Japanese

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Given a matrix, find the minimal path from the top left to the bottom right by only moving to the right and down so that the summation is minimum.

Use linear index to show the path.

For example,

 x=[ 2     2     2     2     2
    10    10    10     1     2
    20    20    20     1     2
    30    30    30    30     2]

The minimal path is -- [1 5 9 13 14 15 19 20]

Solve

Solution Stats

50 Solutions
11 Solvers

Last Solution submitted on Apr 09, 2023

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

Asif Newaz on 16 Apr 2020

William,
I've commented out the last test suite.
can u kindly point out the other path u're getting?

William on 16 Apr 2020

The alternate path is:
[1 11 21 22 32 42 43 44 45 55 56 66 76 77 78 79 89 90 100]

Lincoln Poon on 17 Jun 2021

Here's another alternate path for the last test suite (magic(10)).
[1 2 3 13 14 24 34 35 45 55 56 57 58 68 69 70 80 90 100]

Solution Comments

Show comments

Problem Recent Solvers11

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 45457. Minimal Path - 02

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers11

Suggested Problems

More from this Author165

Problem Tags

Community Treasure Hunt

Problem 45457. Minimal Path - 02

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers11

Suggested Problems

More from this Author165

Problem Tags

Community Treasure Hunt

Players