(Java) Easy 1 line sol with great explaination || Beats 100%
**Upvote if you like ****\n# Code :\n\npublic boolean isRectangleOverlap(int[] rec1, int[] rec2) {\n        return (rec1[0] < rec2[2] && rec1[1] < rec2[3] && re
# *****************Upvote if you like *************\n# Code :\n```\npublic boolean isRectangleOverlap(int[] rec1, int[] rec2) {\n        return (rec1[0] < rec2[2] && rec1[1] < rec2[3] && rec1[2] > rec2[0] &&  rec1[3] > rec2[1]);\n    }\n```\n# Explaination : \n```\n                  2,3\nrec1            (x2,y2)\n         _______\n        |       |\n        |       |\n        |_______|\n    (x1,y1)\n      0,1\n    \n\nrec2            (x2,y2)\n                  2,3\n         _______\n        |       |\n        |       |\n        |_______|\n    (x1,y1)\n      0,1\n\n\nThese 0,1,2,3 just for our convienence\n\nSimple idea is that they will overlap only if\n rect1 k x1,y1 < rect2 k x2,y2  \n rect1 k x2,y2 > rect2 k x1,y1  \n\n```\n
['Java']