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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2643. Row With Maximum Ones

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact