1266. Minimum Time Visiting All Points

On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return the minimum time in seconds to visit all the points in the order given by points. You can move according to these rules: - In 1 second, you can either: - move vertically by one unit, - move horizontally by one unit, or - move diagonally sqrt(2) units (in other words, move one unit vertically then one unit