Minimum path cover DAG
Given a directed acyclic graph with n nodes (0..n-1) and edges [u, v], find the minimum number of vertex-disjoint directed paths needed to cover every vertex exactly once (a single vertex with no edges is a path of length zero). Return that minimum count. The input is guaranteed acyclic. Constraints: 1 <= n <= 300.
Implement
min_path_cover_dag(n: int, edges: list[list[int]]) → intExamples
in
[3,[[0,1],[1,2]]]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 45 min
solution.py
InputExpectedGot
[3,[[0,1],[1,2]]]1not run yetsample