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

• $1 \leq$ rows, cols $\leq 200$

• matrix[i][j] is ‘0’ or ‘1’.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.