Easy solution without any loop with each line explanation with O(1)
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)$$ -->\nHere we didn\'t using any loops or complexity operations . only using some logical few conditions\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nHere we not using additional space rathere than for few variables\n\n# Code\n```typescript []\nfunction isRectangleOverlap(rec1: number[], rec2: number[]): boolean {\n\n\n    // Checking if one rectangle is completely to the left or right of the other\n    if (rec1[2] <= rec2[0] || rec2[2] <= rec1[0]) {\n        return false;\n    }\n    \n    // Checking  if one rectangle is completely above or below the other\n    if (rec1[3] <= rec2[1] || rec2[3] <= rec1[1]) {\n        return false;\n    }\n\n    // Otherwise, the rectangles is overlap\n    return true;\n}\n\n```
['TypeScript', 'JavaScript']