Solution: Smallest Rectangle Enclosing Black Pixels

Explore how to find the area of the smallest axis-aligned rectangle enclosing all connected black pixels in a binary matrix. Learn to apply matrix projections combined with binary search to optimize the solution below O(m×n) time complexity. Understand the use of helper functions and boundary detection to solve matrix problems efficiently.