Leetcode 1184. Distance Between Bus Stops

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1184. Distance Between Bus Stops

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact