<ul><li>You are given a m*n binary matrix, you need to find a row that has maximum number of 1’s in it.</li><li>Two approaches to solve this problem: Brute force approach and Binary Search approach.</li><li>Brute force approach: Traverse the matrix row by row and count the number of 1s in each row. Return the row with the maximum number of 1s.</li><li>Binary Search approach: Since each row is sorted, use binary search to find the first instance of 1 in each row. Return the row with the maximum number of 1s.</li></ul>

Matrix: Find a row with maximum number of 1’s in a binary matrix

Discover more