maximal_rectangle

README

< Previous 　　　　　　　　　　　　　　　　 Next >

85. Maximal Rectangle (Hard)

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

Related Topics

[Stack] [Array] [Hash Table] [Dynamic Programming]

Similar Questions

1. Largest Rectangle in Histogram (Hard)
2. Maximal Square (Medium)