Search⌘ K
AI Features

Solution: Maximal Rectangle

Explore how to apply dynamic programming to solve the maximal rectangle problem in a binary matrix. This lesson helps you understand transforming rows into histograms, tracking boundaries for rectangles, and computing the maximum rectangular area efficiently using height, left, and right arrays. Gain practical skills in optimizing complex 2D problems with linear time and space complexity.

Statement

Given a binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.

Constraints:

  • rows ==== matrix.length

  • cols ==== ...