Problem 45457. Minimal Path - 02

Created by Asif Newaz

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Use linear index to show the path.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For example,</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ x=[ 2     2     2     2     2\n    10    10    10     1     2\n    20    20    20     1     2\n    30    30    30    30     2]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The minimal path is -- [1 5 9 13 14 15 19 20]</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

46 Solutions
9 Solvers

Last Solution submitted on Dec 10, 2021

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

William on 15 Apr 2020

Asif -- In the last problem of the test suite, there are two different paths through the matrix that lead to the same minimal summation.

Asif Newaz on 16 Apr 2020

oh..didn't see that

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]

Problem Recent Solvers9

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

Problem Recent Solvers9

Suggested Problems

More from this Author156

Problem Tags

Community Treasure Hunt

Problem 45457. Minimal Path - 02

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers9

Suggested Problems

More from this Author156

Problem Tags

Community Treasure Hunt

Players