In Java
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    public long largestSquareArea(int[][] bottomLeft, int[][] topRight) {\n        \n        long ans=0;\n        for(int i=0;i<bottomLeft.length;i++)\n        {\n            for(int j=i+1;j<bottomLeft.length;j++)\n            {\n                \n                \n                int Xa=Math.max(bottomLeft[i][0],bottomLeft[j][0]);\n                int Xb=Math.max(bottomLeft[i][1],bottomLeft[j][1]);\n                \n                int Ya=Math.min(topRight[i][0],topRight[j][0]);\n                int Yb=Math.min(topRight[i][1],topRight[j][1]);\n                \n                \n                if(Xa<Ya && Xb<Yb){\n                    \n                    int s=Math.min(Ya-Xa,Yb-Xb);\n                    ans=Math.max(ans, (long)s*s);\n                }\n            }\n         }\n        return ans;\n    }\n}\n```
['Java']