Tags: , | Posted by Admin on 1/12/2012 12:45 PM | Comments (0)

Jim was asked following question in interview recently:

Let suppose you have, following grid on Cartesian coordinate system ( Quadrant I).

o - x - x - x - o
|   |   |   |   |
x - x - x - o - x
|   |   |   |   |
x - o - o - x - x

where,  o => person at intersection  and  x => no person at intersection

class Point {
 int x;
 int y;
 boolean hasPerson;
}


Point findNearestPointWhereAllPeopleCanMeet(Point[] people) {

}

Implement a routine where given a list of people location (points), find a location(point) such that is closest point to all given point.

How would you solve this problem ?

Comments are closed