Cool problem. Optimal solutions sometimes appear if moving up is enabled.
functional programming approach
Congratulations.
Honestly, I have difficulties with this kind of algorithm. I have the feeling that you only increment i or j, but at the end you check all the matrix.
Thanks, Jean-Marie. This solution uses recursive calls of the function. So all elements of the matrix are processed.
If you would like to learn more about functional programming principles, I recommend 'Functional Programming Principles in Scala' course by Martin Odersky at Coursera. It starts soon. Actually, I wrote this solution after taking the course a year ago. It is very interesting to look at the same problem from different points of view.
Thanks for your advice.
Project Euler: Problem 7, Nth prime
538 Solvers
Project Euler: Problem 8, Find largest product in a large string of numbers
328 Solvers
Project Euler: Problem 9, Pythagorean numbers
295 Solvers
Compute a dot product of two vectors x and y
756 Solvers
253 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!