Search⌘ K
AI Features

Solution: Maximal Rectangle

Explore how to apply dynamic programming to identify the largest rectangle filled with 1s in a binary matrix. This lesson teaches you to use histogram transformation and boundary arrays to efficiently calculate maximal rectangle areas, optimizing both time and space complexity in your solutions.

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 ==== ...