Given a binary matrix where each row is sorted in non-decreasing order, find the index of the row that contains the maximum number of 1s. If multiple rows have the same count, return the first one.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.