Gold mine problem using DP

[nikhil072000]

🚀 Feature

Find out the maximum amount of gold, miner can collect using DP. A gold mine of m*n dimensions is given, each element contains a positive integer which is the amount of gold. Initially miner starts from first column but, from any row. Then start moving towards the cell diagonally up right or right or diagonally down right.

Have you read the Contribution Guidelines?

Yes

Pitch

This is a very popular question of DP, asked in many interviews. Please assign this task to me for JAVA.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @anushkarthik05 Go -
Java - @nikhil072000 Javascript -
Kotlin -
Python -

[manan025]

Java assigned @nikhil072000

[anushkarthik05]

Hi @manan025. Can you assign me C++?

[manan025]

@anushkarthik05 - Assigned CPP