René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimum-area-rectangle","name":"#939 - Minimum Area Rectangle - LeetCode JavaScript Solutions","description":"You are given an array of points in the X-Y plane points where points[i] = [xi, yi]. Return the minimum area of a rectangle formed from thes...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[][]} points\n * @return {number}\n */\nvar minAreaRect = function(points) {\n  const pointSet = new Set(points.map(([x, y]) => `${x},${y}`));\n  let result = 0;\n\n  for (let i = 0; i < points.length; i++) {\n    const [x1, y1] = points[i];\n    for (let j = i + 1; j < points.length; j++) {\n      const [x2, y2] = points[j];\n      if (x1 !== x2 && y1 !== y2) {\n        if (pointSet.has(`${x1},${y2}`) && pointSet.has(`${x2},${y1}`)) {\n          const area = Math.abs(x1 - x2) * Math.abs(y1 - y2);\n          result = result === 0 ? area : Math.min(result, area);\n        }\n      }\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 939, #939 - Minimum Area Rectangle, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}