Question

Mrityunjay got an assignment from his school that he has to collect money from each house for next day’s event. The city is built just like a 2-D array and each house owner kept certain amount for Mrityunjay (for ex. The house owner at (i, j) co-ordinate kept A[i,j] for Mrityunjay).

Mrityunjay is in a hurry and he wants to reach home as soon as possible otherwise he will miss the match between India and Bangladesh. Also he can only move to any adjacent house from his location, and he cannot move diagonally. So please find a way so that he will collect maximum am