Available question text
Count the number of 4-directional paths from the unique start to the unique end that visit every non-obstacle cell exactly once on an m×n grid with obstacles. This is essentially counting Hamiltonian paths on the grid (m*n ≤ 20), typically solved with DFS/backtracking and state pruning.
Related questions
Continue with questions that share topics or the same question type.
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 980. Unique Paths III
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source