René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximal-rectangle","name":"#85 - Maximal Rectangle - LeetCode JavaScript Solutions","description":"Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {character[][]} matrix\n * @return {number}\n */\nvar maximalRectangle = function(matrix) {\n  if (!matrix?.length) return 0;\n  let maxArea = 0;\n\n  for (let i = 0; i < matrix.length; i++) {\n    for (let j = 0; j < matrix[0].length; j++) {\n      if (matrix[i][j] === '1') {\n        let minWidth = matrix[0].length;\n\n        for (let k = i; k < matrix.length && matrix[k][j] === '1'; k++) {\n          let width = 0;\n\n          while (width < minWidth && j + width < matrix[0].length && matrix[k][j + width] === '1') {\n            width++;\n          }\n\n          minWidth = Math.min(minWidth, width);\n          maxArea = Math.max(maxArea, minWidth * (k - i + 1));\n        }\n      }\n    }\n  }\n\n  return maxArea;\n};","keywords":"LeetCode 85, #85 - Maximal Rectangle, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}