Smallest Rectangle Enclosing Black Pixels

Understand how to find the area of the smallest rectangle that encloses all connected black pixels in a binary matrix. Learn efficient traversal and optimization techniques to solve this problem with runtime complexity less than O(m×n). Develop skills to approach similar matrix problems during coding interviews.