minimum time visiting all points

Author: anishLearnsToCode

README.md

@@ -327,7 +327,7 @@
 | 1243 | 🔒 [Array Transformation](https://leetcode.com/problems/array-transformation)                                                                        |                                                                                                                                                                             |                                                                                                                                   |
 | 1252 | [Cells With Odd Values In Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix)                                                   |                                                       [![Java](assets/java.png)](src/CellsWithOddValuesInMatrix.java)                                                       |                                                                                                                                   |
 | 1260 | [Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid)                                                                                         |                                                              [![Java](assets/java.png)](src/Shift2DGrid.java)                                                               |                                                                                                                                   |
-| 1266 | [Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points)                                                   |                                                                                                                                                                             |                                                                                                                                   |
+| 1266 | [Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points)                                                   |                                                      [![Java](assets/java.png)](src/MinimumTimeVisitingAllPoints.java)                                                      |                                                                                                                                   |
 | 1271 | [Hexspeak](https://leetcode.com/problems/hexspeak)                                                                                                   |                                                                                                                                                                             |                                                                                                                                   |
 | 1275 | [Find Winner On a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game)                                                 |                                                                                                                                                                             |                                                                                                                                   |
 | 1281 | [Subtract the Product and Sum of Digits of a Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer)            |                                                                                                                                                                             |                                                                                                                                   |

src/MinimumTimeVisitingAllPoints.java

@@ -0,0 +1,12 @@
+public class MinimumTimeVisitingAllPoints {
+    public int minTimeToVisitAllPoints(int[][] points) {
+        int minTime = 0;
+        for (int index = 0 ; index < points.length - 1 ; index++) {
+            minTime += Math.max(
+                    Math.abs(points[index + 1][1] - points[index][1]),
+                    Math.abs(points[index + 1][0] - points[index][0])
+            );
+        }
+        return minTime;
+    }
+}