Sorting and searching problem related to a group of people standing in a rectangle

Please be brutal, and let me know how I've done on this problem, provided I coded it at an interview for a top tech firm.

Time it took me: 44 minutes

Worst case time complexity: O(n2)? Am I right?

Space Complexity: O(n)?

Problem:


A group of people stand before you arranged in rows and columns.
Looking from above, they form an R by C rectangle of people. You will
be given a String[] people containing the height of each person.
Elements of people correspond to rows in the rectangle. Each element
contains a space-delimited list of integers representing the heights
of the people in that row.


Your job is to return 2 specific heights in
a int[]. The first is computed by finding the shortest person in each
row, and then finding the tallest person among them (the
"tallest-of-the-shortest"). The second is computed by finding the
tallest person in each column, and then finding the shortest person
among them (the "shortest-of-the-tallest").

Definition:


Class: TallPeople


Method: getPeople


Parameters: String[]


Returns: int[]


Method signature: int[] getPeople(String[] people) (be sure your method is public)


Constraints:

• people will contain between 2 and 50 elements inclusive.

• Each element of people will contain between 3 and 50 characters inclusive.

-
Each element of people will be a single space-delimited list of positive integers such that:



-
Each positive integer is between 1 and 1000 inclusive with no extra
leading zeros.

-
Each element contains the same number of integers.

-
Each element contains at least 2 positive integers.

-
Each element does not contain leading or trailing whitespace.



Examples:

{"9 2 3",
 "4 8 7"}

Returns: { 4, 7 }


The heights 2 and 4 are the shortest from the rows,
so 4 is the taller of the two. The heights 9, 8, and 7 are the tallest
from the columns, so 7 is the shortest of the 3. 1)

-
Split it up! The current method does more than one thing, I'd create at least three helper methods:

int[][] parseInput(String[] input);
int getMaxOfMinHeightInColumns(int[][] peoples);
int getMinOfMaxHeightInRows(int[][] peoples);

It would be easier to follow and understand.

-
I looks like a bug that the following testcase fails:

@Test
public void test() {
    String[] input = {"9 2 3",
     "4 8 7"};
    int[] result = getPeople(input);
    assertArrayEquals(new int[] {4, 7}, result);
}

-
Reusing the count variable is a bad sing:

count=0;

Try to use two different variables for different purposes and more descriptive names. What does it count? Put that into the name of the variable.

-
A few explanatory variable would be more readable here and remove some duplication:

String[][]findMaxOfMin = new String[people.length][people[0].split(" ").length];
int[][] findMinOfMax = new int[people[0].split(" ").length][people.length];

Consider creating one for people.length and another for people[0].split(" ").length (columnNumber, rowNumber, for example).

-
(String[]) casting seems unnecessary here:

temp[j] = Integer.valueOf( ((String[])people[j].split(" "))[i]);

StackExchange Code Review Q#46329, answer score: 6