BUREAU Hiring | Minimum Time Visiting All Points | On-Campus OA (2024)

Problem Statement On a 2D plane, you are given an array points where points[i] = [xi, yi]. In one second, you can move: Horizontally Vertically Diagonally Return the minimum time required to visit all the given points in the specified order. Example Input points = [[1,1],[3,4],[-1,0]] Output 7 Explanation (1,1) → (3,4) = 3 seconds (3,4) → (-1,0) = 4 seconds Total = 7 Constraints 1 <= points.length <= 100 -100 <= points[i][0], points[i][1] <= 100 Test Cases Test Case ...