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.