Largest identity group
An identity-resolution service receives signals that two account IDs (0..n-1) belong to the same person. Given `n` accounts and a list of `merges` `[a, b]` linking accounts, return the size of the largest merged identity group after applying all merges. Duplicate and already-connected merges are no-ops. 1 <= n <= 200000.
Implement
largest_merged_group(n: int, merges: 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 20 min
solution.py
InputExpectedGot
[6,[[0,1],[1,2],[3,4]]]3not run yetsample