Largest connected component
Given an undirected graph with n nodes (0..n-1) and an edge list, return the size of the largest connected component (the number of nodes in it). The graph may be disconnected and may contain isolated nodes. If n is 0, return 0. Duplicate edges may appear.
Implement
largest_component_size(n: int, edges: list[list[int]]) → intExamples
in
[6,[[0,1],[1,2],[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 25 min
solution.py
InputExpectedGot
[6,[[0,1],[1,2],[3,4]]]3not run yetsample