CodingMediumcod-g733

Subject Union findLevel Mid–Senior~20 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]]) → int

Examples

in[6,[[0,1],[1,2],[3,4]]]out3

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.