DP Solution to this problem: • Dynamic Programming solution to Gold ...
Given a rectangular grid representing gold mine. The grid has N rows and M columns. Each cell has a certain amount of gold in it.
Initially, the miner is at first column (any row). When he moves forward (to the next column) he can either go to previous row, current row or next row.
Find out maximum amount of gold he can collect.
------------------------
Join our 30-days online course to prepare for coding interviews of companies like Google, Amazon, Facebook, Microsoft, etc.
Course On Coding: http://www.ritambhara.in/big-o/
Course On System Design: http://www.ritambhara.in/system-desig...
We have our office in Greater Noida (India) where we run courses for students to prepare them for placements in Top IT companies. For Placement Preparation and Industrial Training call us.
Call: +91-8377803450
Email: [email protected]
Call us to conduct a workshop in your college campus.
Buy our books and prepare for coding interviews on your own.
https://www.amazon.in/Kamal-Rawat/e/B...
For detailed discussions on Interview Questions visit:
http://www.ritambhara.in/