Java O(n). Simple solution. 100 % time, 97% space
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int clock = 0, anti_clock = 0;\n        \n    
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int clock = 0, anti_clock = 0;\n        \n        int anti_start = start, anti_dest = destination;\n        \n        while(start!=destination) {\n            clock+=distance[start];\n            start++;\n            if(start == distance.length) start = 0;\n        }\n        \n        while(anti_start!=anti_dest) {\n            anti_start--;\n            if(anti_start < 0) anti_start = distance.length-1;\n            anti_clock+=distance[anti_start];\n        }\n        \n        return Math.min(clock, anti_clock);\n    }\n}\n```
[]