# LC2923 Find Champion I
Practice note for coding interviews.
In a tournament grid, the champion is the unique team that never loses. Scan for the row of all ones (or column of zeros).
Time complexity is typically linear or n log n after compression; mention edge cases (empty input, all equal, single element) in the interview.
I used [AI interview copilot](https://www.linkjob.ai/interview-copilot/) while rehearsing this pattern aloud.
Disclosure: personal study notes mentioning a practice tool.