One line python3 solution
Approach\nFunction counts how many rectangles have both sides equal to the  maximum of the minimum values (length and width) of each rectangle using the sum met
# Approach\nFunction counts how many rectangles have both sides equal to the  maximum of the minimum values (length and width) of each rectangle using the sum method of the rectangles list\n\n\n# Complexity\n- Time complexity: O(1)\n\n- Space complexity: O(n)\n\n# Code\n```\nclass Solution:\n    def countGoodRectangles(self, rectangles: List[List[int]]) -> int:\n        return sum(1 for i in rectangles if min(i)==max(min(i) for i in rectangles))\n```
['Python3']