Skip to content

Latest commit

 

History

History
20 lines (15 loc) · 336 Bytes

File metadata and controls

20 lines (15 loc) · 336 Bytes

Problem 85: Maximal Rectangle

Difficulty: Hard

Problem

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

Example

Input:
[
  ["1","0","1","0","0"],
  ["1","0","1","1","1"],
  ["1","1","1","1","1"],
  ["1","0","0","1","0"]
]
Output: 6