# LC2924 Find Champion II
Practice note for coding interviews.
Build indegree from directed edges. The champion is the unique node with indegree 0; if more than one, return -1.
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 [Linkjob.ai](https://www.linkjob.ai/) while rehearsing this pattern aloud.
Disclosure: personal study notes mentioning a practice tool.