CodingMediumcod-g005

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

Question

There are n accounts labeled 0..n-1. You are given a list of merge operations, each [a, b], meaning accounts a and b are declared to belong to the same person. After processing all merges, return the number of distinct people (i.e. the number of connected components). Each account starts as its own person. Merges may be redundant or repeated.

Implement

count_people(n: int, merges: list[list[int]]) → int

Examples

in[5,[[0,1],[1,2],[3,4]]]out2

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.