โ† Infosys questions
CodingMedium

Round Trip Gold Mine Problem on Grid

Filed under Infosys

In an NxN grid (1: gold, 0: path, -1: block), find the maximum gold collected in a round trip from (0,0) to (N-1,N-1) and back to (0,0).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Infosys questions

Collected from public candidate posts and coding forums. Updated Nov 2026.