public int minArea(char[][] image, int x, int y) {

        int m = image.length;
        int n = image[0].length;

        int left = searchColumns(image, 0, y, 0, m -  1, true);
        int right = searchColumns(image, y, n - 1, 0, m - 1, false);

        int top = searchRows(image, 0, x, left, right, true);
        int bottom = searchRows(image, x, m - 1, left, right, false);

        return (right - left + 1)*(bottom - top + 1);
    }
An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel.
The black pixels are connected, i.e., there is only one black region. Pixels are connected horizontally
and vertically. Given the location (x, y) of one of the black pixels, return the area of the smallest
(axis-aligned) rectangle that encloses all black pixels.
https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/
src/com/interview/multiarray/SmallestRectangleBlackPixel.java