[python|| O(N)]
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- O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n- O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def countGoodRectangles(self, rectangles: List[List[int]]) -> int:\n        max_len = float(\'-inf\')\n        count = 0\n        for item in rectangles:\n            min_len = min(item)\n            if min_len == max_len:\n                count += 1\n            elif min_len > max_len:\n                max_len = min_len\n                count = 1\n\n        return count\n```
['Python3']