C++ clean easy O(n)|O(1) soln
Traverse both clockwise, and counter clockwise, and return the min of these 2:\n\nint distanceBetweenBusStops(vector<int>& distance, int start, int destination)
Traverse both clockwise, and counter clockwise, and return the min of these 2:\n```\nint distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n        int result1 = 0;\n        int result2 = 0;\n        \n        for (int i = start; i != destination; i = (i + 1) % distance.size()) {\n            result1 += distance[i];\n        }\n        \n        for (int i = destination; i != start; i = (i + 1) % distance.size()) {\n            result2 += distance[i];\n        }\n        \n        return min(result1, result2);\n    }\n```
[]