Find the largest connected area.
This is an interview question. Not hard at all, but can test something out from the interviewee.
The question is:
Give a n*m array, which only have two type of elements within it. Blank and asterisk (*):
Let you to find out the largest connected asterisk (*) area. Note that only the orthogonal elements (share an adjacent border) can be treated as connected.
