Column Winners
scores[r][c] is the score that player r got in round c. For every round (column), find the row number of the player with the highest score and return these row numbers as a list. If players tie in a round, the smallest row number wins.
Example 1
scores [[5,1],[3,9],[5,9]]
returns [0,1]
Round 0: players 0 and 2 tie on 5, so player 0. Round 1: players 1 and 2 tie on 9, so player 1.
Constraints
1 <= rows, columns <= 10
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More NumPy problems
- Compound GrowthEasy
- Count BetweenEasy
- Count IncreasesEasy
- Count Sign ChangesEasy
- Drop Lowest AverageEasy
- Empty SeatsEasy
- Fill MissingEasy
- First Day Over LimitEasy