Minimum Time Visiting All Points

From LeetCode. Chebyshev distance on grid. Solve the geometry problem "Minimum Time Visiting All Points".

Difficulty

easy

Companies

Not listed

Topic

Right-Angled Trianglesgeometry right-triangles

Examples

Input: [1,2,3]

Output: 0

Input: [2,3,4]

Output: 0

Hints

Moving diagonally covers both x and y change simultaneously — the time between two points is `max(|x2-x1|, |y2-y1|)`, not the sum.

Iterate through consecutive point pairs, compute dx and dy as absolute differences, and accumulate `max(dx, dy)` into a total.

A single point in the input means zero travel time. Negative coordinates are allowed; use absolute values.

Minimum Time Visiting All Points

**From LeetCode.** Chebyshev distance on grid. Solve the geometry problem "Minimum Time Visiting All Points".