Gold Mine Problem - Programming Interview Question - IDeserve
Given a gold mine of n*m dimensions. Each field in this mine contains an integer which is the amount of gold in tons. Initially the miner is in first column but can be at any row i. He can move only (right , right up , right down ) that is from a given cell, the miner can move to the cell diagonally up towards the right or right or diagonally down towards the right. Find out maximum amount of gold he can collect.Read full article from Gold Mine Problem - Programming Interview Question - IDeserve
No comments:
Post a Comment