Interview Course Based on Story Questions

## Problem statement

Given an `m x n` binary matrix containing `0's` and `1's`. Find the largest rectangle containing only `1's` and return its _area_.



### Input

The input will be an `m x n` matrix of `0's` and `1's`.  The following is an example input:



```python
[["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
```




# Problem statement

Given an `m x n` binary matrix containing `0's` and `1's`. Find the largest rectangle containing only `1's` and return its _area_.



## Input

The input will be an `m x n` matrix of `0's` and `1's`.  The following is an example input:



```python
[["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
```




DIY: Maximal rectangle

Problem statement

Input