Python 3 || 8 lines,  iteration || T/S: 82% / 30%
\nclass Solution:\n    def largestSquareArea(self, bottomLeft: List[List[int]], \n              topRight  : List[List[int]], res = 0) -> int:\n\n        arr = l
```\nclass Solution:\n    def largestSquareArea(self, bottomLeft: List[List[int]], \n              topRight  : List[List[int]], res = 0) -> int:\n\n        arr = list(zip(bottomLeft,topRight))\n\n        for (((xb1, yb1), (xt1, yt1)), \n             ((xb2, yb2), (xt2, yt2))) in combinations(arr, 2):\n          \n            if all((xb1 < xt2, xb2 < xt1, \n                    yb1 < yt2, yb2 < yt1)):\n\n                xSide = min(xt1, xt2) - max(xb1, xb2)\n                ySide = min(yt1, yt2) - max(yb1, yb2)\n\n                res = max(res, min(xSide, ySide))\n\n        return res*res        \n```\n[https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles/submissions/1260838917/](https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles/submissions/1260838917/)\n\n\nI could be wrong, but I think that time complexity is *O*(*N*^2) and space complexity is *O*(*N*^2), in which *N* ~ `len(bottomleft)`.
['Python3']