Simple & Logical Solution || 0ms || 3 Line Of code
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:$$O(1)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {\n        \n        int overlapx =  Math.min(rec2[2] , rec1[2]) - Math.max(rec2[0] , rec1[0]);\n\n        int overlapy =  Math.min(rec2[3] , rec1[3]) - Math.max(rec2[1] , rec1[1]);\n\n        return overlapx > 0 && overlapy > 0;\n    }\n}\n```
['Geometry', 'Java']