Longest SCC chain
Given a directed graph with n nodes (0..n-1) and a list of directed edges, condense it into its strongly connected components. In the resulting condensation DAG (one super-node per SCC), return the maximum number of SCCs lying on a single directed path (i.e. the length, in nodes, of the longest chain of components). A graph that is itself one SCC has answer 1. Assume 1 <= n <= 5000.
Implement
scc_condensation_longest_chain(n: int, edges: list[list[int]]) → intExamples
in
[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]out3What 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 35 min
solution.py
InputExpectedGot
[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]3not run yetsample