Simple code for python3, you should check and vote for me
\nclass Solution:\n    def largestSquareArea(self, bottomLeft: List[List[int]], topRight: List[List[int]]) -> int:\n        n = len(bottomLeft)\n        maxArea
```\nclass Solution:\n    def largestSquareArea(self, bottomLeft: List[List[int]], topRight: List[List[int]]) -> int:\n        n = len(bottomLeft)\n        maxArea = 0\n        for i in range(n-1):\n            ax1, ay1, ax2, ay2 = bottomLeft[i][0], bottomLeft[i][1], topRight[i][0], topRight[i][1]\n            for j in range(i+1, n):\n                bx1, by1, bx2, by2 = bottomLeft[j][0], bottomLeft[j][1], topRight[j][0], topRight[j][1]\n                overlap_x = min(ax2, bx2) - max(ax1, bx1)\n                overlap_y = min(ay2, by2) - max(ay1, by1)\n                if overlap_x>0 and overlap_y>0:\n                    side = min(overlap_x,overlap_y)\n                    maxArea = max(maxArea, side * side)\n        return maxArea\n\n```\n\nI am Vietnamese. Do you know Vietnam? If not, check it out here [Vietnam](https://en.wikipedia.org/wiki/Vietnam)\n\n
['Python3']