← All problemsSign in

Gold Rush

You are in a Gold Mine, which is a square grid having $N$ rows and $N$ columns numbered from $1$ to $N$, each cell of the grid containing some positive value of gold. You have to move from $1^{st}$ row to $N^{th}$ row. In each row, you have to select a cell and add the gold value in that cell to the total gold you have, and then you move to the next row and select any cell and so on...

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start