Smallest Rectangle Enclosing Black Pixels

Understand how to find the area of the smallest rectangle enclosing connected black pixels in a binary matrix. Learn to apply algorithmic techniques that run faster than O(m × n) by exploring matrix operations and connectivity rules based on horizontal and vertical adjacency.