Leetcode 3565. Sequential Grid Path Cover

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3565. Sequential Grid Path Cover

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact