e1351 v1 inefficient.java

class Solution {
    public int countNegatives(int[][] grid) {
        int counter = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = grid[i].length - 1; j >= 0; j--) {
                if (grid[i][j] >= 0) {
                    break;
                }
                counter++;
            }
        }
        return counter;
    }
}