Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2924. Find Champion II
Given a DAG of n teams where an edge u->v means u is stronger than v, find the unique team with indegree 0 (no team stronger than it) and return its index, or return -1 if there is not exactly one such node.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.