Finding two path that visit given cells in in given order with minimum cost in Given Grid

Asked Oct 15 '16 at 08:19

Active Oct 17 '16 at 08:50

Viewed 429 times

I came across about this problem in a interview, how can we solve this in O(n):

Given a grid of m*n, a player P1 & P2 is at node (x1,y1) & (x2,y2) respectively. There are n gems placed on different positions of grid i.e. (G1,G2,G3…..Gn). Calculate the minimum cost required to pick all the gems. A gem can be picked by a single player. Gems should be picked in particular order i.e. G1 should be picked first then G2 & then G3 so on.

For example:

P1 (1,1) & P2(3,4)

There are 4 gems:

G1 (1,1), G2(2,2),G3(3,2),G4(4,2)

Total cost: 5 P1 will pick G4. P2 will pick G1,G2, G3. Complexity : O(n)

asked Oct 15 '16 at 08:19

smartsn123

1

You defined 'n' twice in your question. – Bernard Oct 15 '16 at 13:47
Do you have a slower solution? If so, please describe it to show you have put some effort into the problem. – j_random_hacker Oct 15 '16 at 18:27
1

Possible duplicate of [Two player grid traversal game](http://stackoverflow.com/questions/39805584/two-player-grid-traversal-game) – Nikhil Pathania Oct 17 '16 at 08:57

Finding two path that visit given cells in in given order with minimum cost in Given Grid

0 Answers0