C++ short solution (5 lines)
If our start stop is greater than our destination stop we will swap the two ( This won\'t cause a change int the ans as we can travel both clockwise and anticlo
If our start stop is greater than our destination stop we will swap the two *( This won\'t cause a change int the ans as we can travel both clockwise and anticlockwise)*  since we need to use the accumulate function.\n\nWe will calculate the total distance to travel full circle and the distance to travel from start to destination (dist1).\n\nThe answer will be minimum of dist1 and (total dist-dist1).\n```\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& d, int start, int destination) {\n        if(start>destination)\n            swap(start,destination);\n        int total=accumulate(d.begin(),d.end(),0);\n        int dist1=accumulate(d.begin()+start,d.begin()+destination,0);\n        return min(dist1,total-dist1);\n    }\n};\n```
['C']