Maximum Treasures On Array - Coding in A Smart Way
Given a 2-D array map where map[i][j] is the number of treasures at the cell (i, j), i.e., row i.th, column j.th. There is a robot from top left cell and it can only move Right or Down. Find the maximum number of treasures that the robot can collect when it reaches the bottom right cell.
Read full article from Maximum Treasures On Array - Coding in A Smart Way
No comments:
Post a Comment