Leetcode 302. Smallest Rectangle Enclosing Black Pixels

Given a binary image and the coordinates of one black pixel, compute the area of the smallest axis-aligned rectangle that contains all black ('1') pixels. The challenge is to determine the top/bottom/left/right boundaries efficiently (e.g., via binary search on rows/columns or DFS/BFS of the connected black region) rather than scanning the entire matrix.