Geometery Thing
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<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def largestSquareArea(self, bl: List[List[int]], tr: List[List[int]]) -> int:\n        val=0\n        area=0\n        n=len(bl)\n        for i in range(n):\n            for j in range(i+1,n):\n                minX=max(bl[i][0],bl[j][0])\n                minY=max(bl[i][1],bl[j][1])\n                maxX=min(tr[i][0],tr[j][0])\n                maxY=min(tr[i][1],tr[j][1])\n                if (maxX>minX and maxY>minY):\n                    val=min(maxX-minX,maxY-minY)\n                    area=max(val*val,area)\n        return area\n```
['Python3']