Python is Beautiful
Complexity\n- Time complexity: O(N)\n\n\n# Code\n\nclass Solution:\n    def countGoodRectangles(self, rectangles: List[List[int]]) -> int:\n        m = [min(n[0
# Complexity\n- Time complexity: O(N)\n\n\n# Code\n```\nclass Solution:\n    def countGoodRectangles(self, rectangles: List[List[int]]) -> int:\n        m = [min(n[0], n[1])**2 for n in rectangles]\n        return m.count(max(m))\n```
['Python3']