Smallest Rectangle Enclosing Black Pixels

Understand how to locate the smallest axis-aligned rectangle enclosing all connected black pixels in a binary matrix. Learn to apply efficient traversal and matrix algorithms that run in less than O(m×n) time, ensuring optimized performance for coding interviews.