Python O(n) -- Easy to understand
\nclass Solution:\n    def distanceBetweenBusStops(self, distance: List[int], start: int, destination: int) -> int:\n        n = len(distance)\n        dist1 = 
```\nclass Solution:\n    def distanceBetweenBusStops(self, distance: List[int], start: int, destination: int) -> int:\n        n = len(distance)\n        dist1 = 0\n        i = start\n        while i != destination:\n            dist1 += distance[i]\n            i = (i+1)%n\n        totalDistance = sum(distance)\n        dist2 = totalDistance-dist1\n        return min(dist1,dist2)\n```
[]