Busiest Column
visits[r][c] is how many people entered through door c during hour r. Return the number of the door (column) with the most people in total. If two doors tie, return the smaller number.
Example 1
visits [[1,5],[2,1],[3,0]]
returns 0
Door 0 has 6 people in total and door 1 has 6 as well; the tie goes to door 0.
Constraints
1 <= rows, columns <= 10- Values are 0 or more
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More NumPy problems
- Change Between RowsEasy
- Close EnoughEasy
- Closest to OriginEasy
- Closest to TargetEasy
- Column MaximumsEasy
- Column WinnersEasy
- Compound GrowthEasy
- Count BetweenEasy