Java Solution
Code\n\nclass Solution {\n    public long largestSquareArea(int[][] bottomLeft, int[][] topRight) {\n        long area = 0;\n        int n = bottomLeft.length;\
# Code\n```\nclass Solution {\n    public long largestSquareArea(int[][] bottomLeft, int[][] topRight) {\n        long area = 0;\n        int n = bottomLeft.length;\n        for(int i = 0; i < n; i++) {\n            for(int j = i+1; j < n; j++) {\n                int bottom_left_x = Math.max(bottomLeft[i][0], bottomLeft[j][0]);\n                int top_right_x = Math.min(topRight[i][0], topRight[j][0]);\n                int bottom_left_y = Math.max(bottomLeft[i][1], bottomLeft[j][1]);\n                int top_right_y = Math.min(topRight[i][1], topRight[j][1]);\n\n                if(bottom_left_x < top_right_x && bottom_left_y < top_right_y) {\n                    long side = Math.min(top_right_x - bottom_left_x, top_right_y - bottom_left_y);\n                    area = Math.max(area, side*side);\n                }\n            }\n        }\n\n        return area;\n    }\n}\n```
['Java']