Given a matrix, find the minimal path sum from any cell in the left column and finishing in any cell in the right column.
You can move up, right & down.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers10
Suggested Problems
-
19673 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
182 Solvers
-
Back to basics 18 - justification
211 Solvers
-
316 Solvers
-
487 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!