**By: Saurav**

**2017-10-21 09:06:00 UTC**

You are in an infinite 2D grid where you can move in any of the 8 directions :

(x,y) to

(x+1, y),

(x - 1, y),

(x, y+1),

(x, y-1),

(x-1, y-1),

(x+1,y+1),

(x-1,y+1),

(x+1,y-1)

You are given a sequence of points and the order in which you need to cover the points. Give the minimum number of steps in which you can achieve it. You start from the first point.

Example :

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

Output : 2

It takes 1 step to move from (0, 0) to (1, 1). It takes one more step to move from (1, 1) to (1, 2).

This question is intentionally left slightly vague. Clarify the question by trying out a few cases in the “See Expected Output” section.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

Turns out. Why do min + (max-min) when we can just focus on max as well as ruby's minmax function

Owned & Maintained by Saurav Prakash

If you like what you see, you can help me cover server costs or buy me a cup of coffee though donation :)