Solving Minimum Time Visiting All Points in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

## Problem Description

You can move according to the next rules:

• In one second always you can either move vertically, horizontally by one unit or diagonally (it means to move one unit vertically and one unit horizontally in one second).
• You have to visit the points in the same order as they appear in the array.

Example 1:

``````Input: points = [[1,1],[3,4],[-1,0]]
Output: 7
Explanation: One optimal path is [1,1] -> [2,2] -> [3,3] -> [3,4] -> [2,3] -> [1,2] -> [0,1] -> [-1,0]
Time from [1,1] to [3,4] = 3 seconds
Time from [3,4] to [-1,0] = 4 seconds
Total time = 7 seconds``````

Example 2:

``````Input: points = [[3,2],[-2,2]]
Output: 5``````

Constraints:

• `points.length == n`

• `points[i].length == 2`

• points.length == n

• points[i].length == 2

See the full details of the problem Minimum Time Visiting All Points at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go