Smallest Rectangle Enclosing Black Pixels

Explore how to find the smallest axis-aligned rectangle enclosing all connected black pixels in a binary matrix using an efficient algorithm. Understand the problem constraints, connectivity rules, and optimize your solution to run faster than O(m × n).