Find Row With Minimum Ones

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Find Row With Minimum Ones. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

The Navi app represents a binary status matrix where each row is sorted in nondecreasing order, so every 0 appears before every 1. Find the index of the row containing the minimum number of 1s.

If multiple rows contain the same minimum number of 1s, return the smallest row index.

Formal Specification

Implement find_row_with_min_ones(matrix), where matrix is a non-empty rectangular list of lists containing only 0 and 1. Return an integer representing the zero-based index of the qualifying row.

Use the sorted order of each row to avoid counting every element individually.

Constraints

1 <= matrix.length <= 10^5
1 <= matrix[i].length <= 10^5
The matrix is rectangular
The total number of elements is at most 10^6
Each row is sorted and contains only 0 and 1

Function Signature

def find_row_with_min_ones(matrix):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output