Critical path length
Given a DAG on n nodes (0..n-1) and a list of weighted directed edges [u, v, w] with positive integer weights, return the maximum total weight of any directed path (the critical path length). A single node with no edges contributes a path of length 0. The graph is guaranteed acyclic.
Implement
longest_dag_path(n: int, edges: list[list[int]]) → intExamples
in
[5,[[0,1,3],[0,2,2],[1,3,4],[2,3,1],[3,4,2]]]out9What 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 30 min
solution.py
InputExpectedGot
[5,[[0,1,3],[0,2,2],[1,3,4],[2,3,1],[3,4,2]]]9not run yetsample