Smallest Rectangle Enclosing Black Pixels

Understand how to identify and calculate the smallest axis-aligned rectangle enclosing all connected black pixels in a binary matrix. Explore efficient algorithms to solve this problem with a runtime faster than O(mn), focusing on matrix traversal and problem-solving techniques useful in coding interviews and image processing tasks.