✅ C++ || Faster than 100% || Simple and Easy to understand
We can travel from start to finish in two directions, i.e Clockwise and Anti-Clockwise.\nWe need to find the minimum of the two distances. So if we calculate th
We can travel from start to finish in two directions, i.e **Clockwise** and **Anti-Clockwise**.\nWe need to find the minimum of the two distances. So if we calculate the total distance in one direction, it can easily be used to find the distance in the opposite direction.\n\nSo **Anti-Cockwise distance = Total distance covered in going full circle - Clockwise distance**\n\n\n```\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        int total = accumulate(distance.begin(),distance.end(),0),clockwise=0,n=distance.size();\n        int i = start;\n        do{\n            clockwise+=distance[i%n];\n            i++;\n        }while(i%n != destination);\n        return min(clockwise,total-clockwise);\n    }\n};\n```
['C', 'C++']