Shortest Path to Gold in a Grid
Given an m × n grid containing a robber's starting position (*), one or more gold cells ($), open cells (O), and obstacles (X), find the length of the shortest path from the robber's starting position to any gold cell.
Asked at:
eBay
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late July, 2026
eBay
Senior
Given an m × n grid containing a robber’s starting position (*), one or more gold cells ($), open cells (O), and obstacles (X), find the length of the shortest path from the robber to any gold cell.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.