Available question text
Find the maximum sum of gold collectible by walking a path on an m x n grid that starts at any nonzero cell, moves up/down/left/right, cannot enter zero cells or revisit cells, and collects the gold from each visited cell. This is solved by exploring all simple paths via DFS/backtracking (feasible given m,n ≤ 15 and ≤ 25 gold-containing cells).
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Maximum Path Quality of a Graph
Coding · Array · Backtracking · Graph Theory
- Maximum Path Sum with Conditional Node Processing
Coding
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1219. Path with Maximum Gold
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source