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
-
Back to basics 19 - character types
275 Solvers
-
How many trades represent all the profit?
619 Solvers
-
657 Solvers
-
Circular Primes (based on Project Euler, problem 35)
655 Solvers
-
387 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!