c++
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     long long solve(int l1, int r1, int l2, int r2){\n    if(l2 <= l1 && r2 >= r1 ) { return r1 - l1; }\n    if(l1 <= l2 && r1 >= r2 ) { return r2 - l2; }\n    if(l2 <= r1 && r2 >= r1 ) { return r1 - l2; }\n    if(l2 <= r1 && r2 >= l1 ) { return r2 - l1; }\n    return 0;\n}\npublic:\n    long long largestSquareArea(vector<vector<int>>& bottomleft, vector<vector<int>>& topright)\n     {\n         long long ans =0;\n         for(int i=0;i<bottomleft.size();i++){\n             for(int j=i+1;j<topright.size();j++){\n                long long x=solve(bottomleft[i][0],topright[i][0],bottomleft[j][0],topright[j][0]);\n                long long y=solve(bottomleft[i][1],topright[i][1],bottomleft[j][1],topright[j][1]);\n                ans=max(ans,min(x,y));\n             }\n         }\n       return ans*ans;\n    }\n};\n```
['C++']