Smallest Rectangle Enclosing Black Pixels

Explore how to identify the smallest axis-aligned rectangle that encloses all connected black pixels in a binary matrix. Learn to design an algorithm with runtime complexity less than O(mn), understanding matrix connectivity and coordinate constraints to solve this efficient coding problem.