Question: Row with max 1s

Intution: Not exactly binary search but we can utilize the fact that it the row is sorted. We have to use 2 pointers approach.

Time Complexity: $$O(n + m)$$

Space Complexity: $$O(1)$$

Solution:

class Solution {
    public int rowWithMax1s(int arr[][]) {
        int n = arr.length;
        int m = arr[0].length;
        int i = 0;
        int j = m - 1;
        int ans = -1;
        while (i < n && j >= 0) {
            if (arr[i][j] == 1) {
                ans = i;
                j--;
            } else {
                i++;
            }
        }
        return ans;
    }
}