René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/perfect-rectangle","name":"#391 - Perfect Rectangle - LeetCode JavaScript Solutions","description":"Given an array rectangles where rectangles[i] = [xi, yi, ai, bi] represents an axis-aligned rectangle. The bottom-left point of the rectangl...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[][]} rectangles\n * @return {boolean}\n */\nvar isRectangleCover = function(rectangles) {\n const result = new Set();\n let area = 0;\n let minX = Infinity;\n let maxX = -Infinity;\n let minY = Infinity;\n let maxY = -Infinity;\n\n for (const [x1, y1, x2, y2] of rectangles) {\n area += (x2 - x1) * (y2 - y1);\n minX = Math.min(minX, x1);\n minY = Math.min(minY, y1);\n maxX = Math.max(maxX, x2);\n maxY = Math.max(maxY, y2);\n for (const corner of [`${x1},${y1}`, `${x2},${y1}`, `${x1},${y2}`, `${x2},${y2}`]) {\n result.has(corner) ? result.delete(corner) : result.add(corner);\n }\n }\n\n return area === (maxX - minX) * (maxY - minY) && result.size === 4\n && result.has(`${minX},${minY}`) && result.has(`${maxX},${minY}`)\n && result.has(`${minX},${maxY}`) && result.has(`${maxX},${maxY}`);\n};","keywords":"LeetCode 391, #391 - Perfect Rectangle, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}