Code Room
CodingMediumcod-g1221
Subject Data wranglingLevel Entry–Mid~14 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Two HR systems were merged, and the combined feed has rows "id,email". The same id may appear many times; identical repeats are fine, but an id listed with two or more DIFFERENT emails is a data conflict that must be escalated. Return the conflicting ids, sorted ascending. Example: ["e1,ava@co.io", "e2,raj@co.io", "e1,ava@old.io"] gives ["e1"].

Implement
conflicting_ids(rows: list[str]) → list[str]
Examples
in[["e1,ava@co.io","e2,raj@co.io","e1,ava@old.io"]]out["e1"]
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.

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.