CareerCup

Input: set of coordinates = [P1,P2,...,Pi,.....Pj,....Pn]

P denote Point(x,y)

Start point is any of set of coordinates like Pi
simily end point is also any of set of coordinates like Pj.
Find the shortest path with set of points between start and end points.

Let us have a simple example

Set of coordinates :
P4 P5 P6

P1 P2 P3 P7 P8 P9 P11 P12 P13

P10
Start Point: P2
End Points: p12
Output: P2,P3, P7,P8,P9,P11,P12

"Min(Max elements rows) not less than Max(Min of columns)"
can you tell me whether above statement ist true or false..
if it true, then tell me solutoin.
if it false, then tell me example

Input: set of coordinates = [P1,P2,...,Pi,.....Pj,....Pn]

P denote Point(x,y)

Start point is any of set of coordinates like Pi
simily end point is also any of set of coordinates like Pj.
Find the shortest path with set of points between start and end points.

Let us have a simple example

Set of coordinates :
P4 P5 P6

P1 P2 P3 P7 P8 P9 P11 P12 P13

P10
Start Point: P2
End Points: p12
Output: P2,P3, P7,P8,P9,P11,P12