Search⌘ K

Solution: Maximal Rectangle

Let’s solve the Maximal Rectangle problem using the Dynamic Programming pattern.

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 ==== matrix[i].length

  • 11 \leq rows, cols 200\leq 200 ...