simple brute force
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```\n\nclass Solution {\npublic:\n\n    const long long INFNEG = LLONG_MIN;\n    long long largestSquareArea(vector<vector<int>>& bottomLeft, vector<vector<int>>& topRight) {\n\n        const int n = (int) bottomLeft.size();\n\n\n        long long answer = INFNEG;\n        for (int i=0; i<n; i++){\n            for (int j=i+1; j<n; j++){\n\n                long long mxLeft = max(bottomLeft[i][0], bottomLeft[j][0]);\n                long long mnRight = min(topRight[i][0], topRight[j][0]);\n                long long mnUp = min(topRight[i][1], topRight[j][1]);\n                long long mxDown = max(bottomLeft[i][1], bottomLeft[j][1]);\n\n                if (!(mxLeft < mnRight && mnUp > mxDown)) continue;\n\n                long long area = min(mnUp - mxDown, mnRight - mxLeft);\n\n                answer = max(answer, area);\n            }\n        }\n\n        answer = max(answer, 0LL);\n\n        return answer*answer;\n    }\n\n    \n};\n```
['C++']