concise C++ solution. Straightforward.
\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        if(start == destination) return 0;\n 
```\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        if(start == destination) return 0;\n        int sum = accumulate(distance.begin(), distance.end(), 0);\n        int a = 0;\n        for(int i = min(start, destination); i < max(start, destination); ++i) {\n            a += distance[i];\n        }\n        return min(a, sum - a);\n    }\n};\n```
[]