Duplicate jersey claims
A league database stores jersey assignments as rows "team,number,player". Within one team, a jersey number must belong to exactly one player; the same row may legitimately repeat, and the same number on DIFFERENT teams is fine. Find every (team, number) pair claimed by two or more distinct players and return each as the string "team,number", sorted ascending as plain strings. Example: ["hawks,7,ava", "hawks,7,raj", "owls,7,mia"] gives ["hawks,7"].
Implement
jersey_conflicts(rows: list[str]) → list[str]Examples
in
[["hawks,7,ava","hawks,7,raj","owls,7,mia"]]out["hawks,7"]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.
0:00 of about 14 min
solution.py
InputExpectedGot
[["hawks,7,ava","hawks,7,raj","owls,7,mia"]]["hawks,7"]not run yetsample