How can i find the row which has the most 0 values in an int 2D array?

How can i find the row which has the most 0 values in an int 2D array?

Example:

int[][] arr = new int[4][5]; 
arr[0][0] = 1;
arr[0][1] = 2;
arr[0][2] = 3;
arr[0][3] = 4;

arr[1][0] = 29;
arr[1][1] = 28;
arr[1][2] = 27;

arr[2][0] = 3;
arr[2][1] = 33;

arr[3][0] = 41;
arr[3][1] = 42;
arr[3][2] = 43;
arr[3][3] = 43;

The answer is should be Row index 2

There are several ways to achieve your goal. I would use streams for that job:

    int[][] arr = new int[4][5]; 
    arr[0][0] = 1;
    arr[0][1] = 2;
    arr[0][2] = 3;
    arr[0][3] = 4;
    
    arr[1][0] = 29;
    arr[1][1] = 28;
    arr[1][2] = 27;
    
    arr[2][0] = 3;
    arr[2][1] = 33;

    arr[3][0] = 41;
    arr[3][1] = 42;
    arr[3][2] = 43;
    arr[3][3] = 43;
    
    IntStream.range(0, arr.length).boxed()
            .map(row -> Map.entry(row, Arrays.stream(arr[row]).filter(i -> i != 0).count()))
            .min(Comparator.comparing(Entry::getValue))
            .map(Entry::getKey)
            .ifPresent(row -> System.out.println("Row: " + row));

Output

Row: 2

Update

If you want to use a for loop you can do:

    int row = -1;
    int maxZeros = 0;
    
    for (int i = 0; i < arr.length; i++) {
        int zeros = 0;
        for (int j = 0; j < arr[i].length; j++) {
            if (arr[i][j] == 0) {
                zeros++;
            }
        }
        if (zeros > maxZeros) {
            maxZeros = zeros;
            row = i;
        }
    }
    
    if (row > -1) {
        System.out.println("Row: " + row);
    }

Output

Row: 2