Smallest Rectangle Enclosing Black Pixels

Understand how to determine the smallest axis-aligned rectangle enclosing all connected black pixels in a binary matrix. Explore efficient algorithms that operate below O(m×n) complexity, utilizing matrix traversal and problem-solving techniques to optimize pixel region identification.