You are given a $2 ext{D}$ binary array grid. Find the minimum area of a rectangle with sides parallel to the grid edges that encloses all cells with a value of $1$.

Constraints:

• $1 \leq$ grid.length, grid[i].length $\leq 1000$

• grid[i][j] is either $0$ or $1$.

• The input is generated such that there is at least one $1$ in grid.

Now, 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.