Python 2 liner solution with explanation
\n######################################################\n\n#   Runtime: 168ms   -   100.00%\n#   Memory: 14.8MB  -   73.29%\n\n################################
```\n######################################################\n\n#   Runtime: 168ms   -   100.00%\n#   Memory: 14.8MB  -   73.29%\n\n######################################################\n\nclass Solution:\n    def countGoodRectangles(self, rectangles: List[List[int]]) -> int:\n        # len_arr is a list where len_arr[i] is the max length of the square\n        # that can be formed using rectangle[i] which will be min of length\n        # and breadth of that rectangle\n        len_arr = [min(rectangle) for rectangle in rectangles]\n        # To find how many squares have max len, we first have to find the\n        # max len. So, max(len_arr). Now, we need to count how many max len\n        # are present in len_arr. So, len_arr.count(max(len_arr)) which is \n        # the required answer. so we return it\n        return len_arr.count(max(len_arr))\n```
['Python']