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.