Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given a double dimension matrix with all positive numbers how do I traverse the matrix from one corner to the other such that the sum of values along the path is maximum?
You can move only left, right, up or down i.e cannot move diagonally.
You cannot move backwards i.e you always have to move towards the other corner
Try a boustrophedonic traversal. I repeat the advice to comply with SO’s minimum posting length. Try a boustrophedonic traversal.