LeetCode Entry

1266. Minimum Time Visiting All Points

12.01.2026 easy 2026 kotlin rust

Euclid travel distance

1266. Minimum Time Visiting All Points easy blog post substack youtube

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1235

Problem TLDR

Euclid travel distance #easy #brainteaser

Intuition

D = max(dx,dy)

Approach

• indices: [1..n)
• zip, zipWithNext, windows, fold

Complexity

• Time complexity: \(O(n)\)

• Space complexity: \(O(1)\)

Code

// 6ms
    fun minTimeToVisitAllPoints(p: Array<IntArray>) = (1..<p.size)
    .sumOf {i->max(abs(p[i][0]-p[i-1][0]), abs(p[i][1]-p[i-1][1]))}

// 0ms
    pub fn min_time_to_visit_all_points(p: Vec<Vec<i32>>) -> i32 {
        p.iter().zip(&p[1..]).map(|(a,b)|(a[0]-b[0]).abs().max((a[1]-b[1]).abs())).sum()
    }