Compute suffix sums over waypoints

Q: Compute suffix sums over waypoints

This is a Coding & Algorithms interview question from Tesla for Machine Learning Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Problem

You are given a batch of 2D waypoint trajectories.

Input: points with shape [B, N, 2] , where points[b][i] = (x, y) is the i-th waypoint for batch item b .
Output: rem with shape [B, N] .

For each batch item b and waypoint index i, define rem[b][i] as the remaining path length from waypoint i to the end, computed as the suffix sum of Euclidean segment lengths:

$rem[b][i] = \sum_{j=i}^{N-2} \|points[b][j+1] - points[b][j]\|_2$

Also define rem[b][N-1] = 0.

Requirements

Time complexity: O(B·N) .
Handle edge cases such as N = 1 .

Compute suffix sums over waypoints

Problem

Requirements

Comments (0)