Leetcode 2643. Row With Maximum Ones
Given an m x n binary matrix, find the 0-indexed row with the largest number of 1s (breaking ties by the smallest row index) and return [rowIndex, countOfOnes].
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.