Notes

Alien Fred wants to destroy the Earth. But before he does that, he wants to play the following game.

He has a rectangular board divided into unit cells. Each cell is initially painted black or white. You are given a String[] board. The character board[i][j] represents the cell with coordinates (i, j). Each of those characters is either 'B' (representing a black cell) or 'W' (representing a white cell). The game is played in turns. In each turn Fred can choose any row of the board and repaint all black cells of the row to white, and vice versa. (Note that he can only select rows, not columns. Formally, he can choose an index i and change all characters of board[i].)

Fred wants to have a large white square somewhere on his board. The sides of Fred's square must be parallel to the sides of the board. The white square may be a part of a larger white area. (I.e., the cells that touch the square may be both black and white.) Find a sequence of turns that produces the largest possible white square somewhere on the board, and return the area of that square.
Definition
Class: AlienAndGame
Method: getNumber (be sure your method is public)
Parameters: String[]
Returns: int
Method signature: int getNumber(String[] board)
Constraints
board will contain between 1 and 50 elements, inclusive.
Each element of board will contain between 1 and 50 characters, inclusive.
Each element of board will contain the same number of characters.
Each character in each element of board will be either 'B' or 'W'.
Examples
Example #1
{"BB", "WW"}
Returns: 4

Example #2
{"W"}
Returns: 1

Example #3
{"WBBB", "WBBB", "WWWW"}
Returns: 9

Example #4
{"W", "B", "W", "W", "W"}
Returns: 1

Example #5
{"BWBBWBB", "WWBWWBW", "BBBBBBW", "WBBBBWB", "BBWWWWB", "WWWWWWW", "BBWWBBB"}
Returns: 9