Java O(N) 3ms with easy to understand
Very easy question. Just follow what is being said.\n\n\nclass Solution {\n    public int countGoodRectangles(int[][] rectangles) {\n        int maxLen = 0;\n  
Very easy question. Just follow what is being said.\n\n```\nclass Solution {\n    public int countGoodRectangles(int[][] rectangles) {\n        int maxLen = 0;\n        int count = 0;\n        for(int i=0;i<rectangles.length;i++){\n            int len = Math.min(rectangles[i][0], rectangles[i][1]);\n            if(len > maxLen){\n                maxLen = len;\n                count = 1;\n            }else if(len == maxLen){\n                count++;\n            }\n        }\n        return count;\n    }\n}\n```
['Java']