Simple JAVA Solution for beginners. 2ms. Beats 92.57%.
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int countGoodRectangles(int[][] rectangles) {\n        int maxLength = 0;\n        int minLength;\n        int count = 0;\n        for(int i = 0; i < rectangles.length; i++) {\n            minLength = Integer.min(rectangles[i][0], rectangles[i][1]);\n            if(maxLength < minLength) {\n                maxLength = minLength;\n                count = 1;\n            } else if(maxLength == minLength) {\n                count++;\n            }\n        }\n        return count;\n    }\n}\n```
['Array', 'Java']