Simple JS solution..Easy to understand
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/**\n * @param {number[][]} bottomLeft\n * @param {number[][]} topRight\n * @return {number}\n */\nvar largestSquareArea = function(bottomLeft, topRight) {\n    let area=0;\n    for(let i=0;i<bottomLeft.length;i++){\n        for(let j=i+1;j<bottomLeft.length;j++){\n            // finding the intersection points \n            let x1=Math.max(bottomLeft[i][0],bottomLeft[j][0]);\n            let y1=Math.max(bottomLeft[i][1],bottomLeft[j][1]);\n            let x2=Math.min(topRight[i][0],topRight[j][0]);\n            let y2=Math.min(topRight[i][1],topRight[j][1]);\n            \n            if(x1<x2 && y1<y2){\n                let side=Math.min(x2-x1,y2-y1);\n                 area=Math.max(area,side*side);\n            }\n        }\n    }\n    return area;\n};\n```
['JavaScript']