Available question text
Given a sequence of positions or movement updates, compute the total distance traveled by summing the distances between consecutive positions (absolute differences in 1D or Euclidean distances in 2D). The core challenge is a single-pass accumulation of those pairwise distances, correctly handling reversals and repeated positions.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Total Distance Traveled
Coding
- Total Distance Traveled
Coding
- Total Hamming Distance
Coding · Array · Bit Manipulation · Math
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2837. Total Traveled Distance
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source