Available question text
Given an m×n grid with some cells that must be visited in a specific adjacency-based sequence, find the minimum number of vertex-disjoint paths that together cover all required cells while respecting the allowed sequential moves. This reduces to a minimum path-cover problem on a directed acyclic graph and is typically solved by graph construction plus maximum matching or DP on the DAG.
Related questions
Continue with questions that share topics or the same question type.
- Check if There is a Valid Path in a Grid
Coding
- Find the Safest Path in a Grid
Coding · Array · Binary Search · Breadth-First Search
- Minimum Cost to Make at Least One Valid Path in a Grid
Coding
- Minimum Number of Planks to Cover Holes in a Grid
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 3565. Sequential Grid Path Cover
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source