Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2923. Find Champion I
Given an n×n matrix where grid[i][j]=1 iff team i is stronger than team j, return the champion — the team with no opponents stronger than it (i.e., no 1s in its column). The matrix is antisymmetric and transitive, so such a unique champion exists.
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.