C++ simplest intuitive solution with explanations
\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        int n = distance.size();\n        if 
```\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        int n = distance.size();\n        if (start == destination)\n            return 0;\n\n        int one_way = 0;\n        int i = start;\n        while (i != destination) // find distance of one way\n        {\n            one_way += distance[i];\n            i = (i+1)%n;\n        }\n        \n        int second_way = 0;\n        i = destination;\n        while (i != start) // find distance of second way\n        {\n            second_way += distance[i];\n            i = (i+1)%n;\n        }\n        \n        return one_way<second_way? one_way : second_way; // return the minimum\n    }\n};\n```
['C']