Available question text
Given a circular array of distances between adjacent stops, compute the shortest distance between two stops by summing the distances along one direction and taking the minimum with the complementary distance around the circle.
Related questions
Continue with questions that share topics or the same question type.
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 1184. Distance Between Bus Stops
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source