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 Solvers9
Suggested Problems
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
178 Solvers
-
433 Solvers
-
239 Solvers
-
Moving average (variable kernel length)
137 Solvers
-
11509 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!