We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b767951 commit 47c9b9aCopy full SHA for 47c9b9a
1266_Minimum_Time_Visiting_All_Points.java
@@ -1,7 +1,13 @@
1
-// id: 1266
2
-// Name: Minimum Time Visiting All Points
3
-// link: https://leetcode.com/problems/minimum-time-visiting-all-points/
4
-// Difficulty: Easy
+/*
+ * 1266. Minimum Time Visiting All Points
+ * Problem Link: https://leetcode.com/problems/minimum-time-visiting-all-points/
+ * Difficulty: Easy
5
+ *
6
+ * Solution Created by: Muhammad Khuzaima Umair
7
+ * LeetCode : https://leetcode.com/mkhuzaima/
8
+ * Github : https://github.com/mkhuzaima
9
+ * LinkedIn : https://www.linkedin.com/in/mkhuzaima/
10
+ */
11
12
class Solution {
13
public int minTimeToVisitAllPoints(int[][] points) {
0 commit comments