EASY AF, JAVA, one-liner, beats 100%, with explanation
\nclass Solution {\n    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {\n        //Logic here is to compare x and y of correspoding points in both r
```\nclass Solution {\n    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {\n        //Logic here is to compare x and y of correspoding points in both rectangle\n        //If Mininum of top right corners (both x and y) lies beyond(is greater than) Maximum of bottom left corners(both x and y), we have at least one overlapping point\n        return Math.min(rec1[2],rec2[2]) > Math.max(rec1[0],rec2[0]) && Math.min(rec1[3],rec2[3]) > Math.max(rec1[1],rec2[1]); \n    }\n}\n```
[]