Smallest Rectangle Enclosing Black Pixels

Explore how to identify the minimum axis-aligned rectangle enclosing all connected black pixels in a binary matrix using a runtime-efficient algorithm. Understand matrix traversal and connectivity concepts to implement solutions that run faster than O(m × n).