Question

How to move from one point to another point in a infinite 2d matrix

Answer 1

Answer: Given an infinite grid, initial cell position (x, y) and a sequence of other cell position which needs to be covered in the given order. The task is to find the minimum number of steps needed to travel to all those cells.

Note: Movement can be done in any of the eight possible directions from a given cell i.e from cell (x, y) you can move to any of the following eight positions:(x-1, y+1), (x-1, y), (x-1, y-1), (x, y-1), (x+1, y-1), (x+1, y), (x+1, y+1), (x, y+1) is possible.

Answer 2

Answer:

Explanation:

Given an infinite grid, initial cell position (x, y) and a sequence of other cell position which needs to be covered in the given order. The task is to find the minimum number of steps needed to travel to all those cells.

Note: Movement can be done in any of the eight possible directions from a given cell i.e from cell (x, y) you can move to any of the following eight positions:(x-1, y+1), (x-1, y), (x-1, y-1), (x, y-1), (x+1, y-1), (x+1, y), (x+1, y+1), (x, y+1) is possible.

Examples:

Input: points[] = [(0, 0), (1, 1), (1, 2)]

Output: 2

Move from (0, 0) to (1, 1) in 1 step(diagonal) and

then from (1, 1) to (1, 2) in 1 step (rightwards)

Input: points[] = [{4, 6}, {1, 2}, {4, 5}, {10, 12}]

Output: 14

Move from (4, 6) -> (3, 5) -> (2, 4) -> (1, 3) ->

(1, 2) -> (2, 3) -> (3, 4) ->

(4, 5) -> (5, 6) -> (6, 7) ->

(7, 8) -> (8, 9) -> (9, 10) -> (10, 11) -> (10, 12)