C++ SIMPLE AND EASY
\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        int d1=0,d2=0;\n        int n = dista
```\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        int d1=0,d2=0;\n        int n = distance.size();\n        int s=start,d=destination;\n        while(s != destination){\n            d1+=distance[s];\n            s++;\n            s=s%n;\n        }\n        while(d != start){\n            d2+=distance[d];\n            d++;\n            d%=n;\n        }\n        return min(d1,d2);\n    }\n};\n```
[]