<p>You are given a 2D <strong>binary</strong> array <code>grid</code>. Find a rectangle with horizontal and vertical sides with the<strong> smallest</strong> area, such that all the 1&#39;s in <code>grid</code> lie inside this rectangle.</p>

<p>Return the <strong>minimum</strong> possible area of the rectangle.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">grid = [[0,1,0],[1,0,1]]</span></p>

<p><strong>Output:</strong> <span class="example-io">6</span></p>

<p><strong>Explanation:</strong></p>

<p><img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect0.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 279px; height: 198px;" /></p>

<p>The smallest rectangle has a height of 2 and a width of 3, so it has an area of <code>2 * 3 = 6</code>.</p>
</div>

<p><strong class="example">Example 2:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">grid = [[1,0],[0,0]]</span></p>

<p><strong>Output:</strong> <span class="example-io">1</span></p>

<p><strong>Explanation:</strong></p>

<p><img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect1.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 204px; height: 201px;" /></p>

<p>The smallest rectangle has both height and width 1, so its area is <code>1 * 1 = 1</code>.</p>
</div>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= grid.length, grid[i].length &lt;= 1000</code></li>
	<li><code>grid[i][j]</code> is either 0 or 1.</li>
	<li>The input is generated such that there is at least one 1 in <code>grid</code>.</li>
</ul>

import numpy as np
class Solution:
    def minimumArea(self, grid: List[List[int]]) -> int:
        t_grid = np.zeros((len(grid), len(grid[0])))
        for i in range(len(grid)) : 
            for j in range(len(grid[0])) : 
                t_grid[i][j] = grid[i][j]
        print(t_grid)
        top = 0
        bottom = len(t_grid)-1
        #t_grid for rows
        for i in range(len(t_grid)) :
            if 1 in t_grid[i] : 
                top = i
                break
        while 1 not in t_grid[bottom] and bottom >= 0 : 
            bottom -=1
        height = bottom - top + 1

        #trans_t_grid for cols
        trans_t_grid = np.transpose(t_grid)
        left = 0
        right = len(trans_t_grid)-1
        for i in range(len(trans_t_grid)) :
            if 1 in trans_t_grid[i] : 
                left=i
                break
        while 1 not in trans_t_grid[right] and right >= 0 : 
            right-=1
        width = right - left + 1
        print(top, bottom)
        print(right, left)
        return height*width
58800