Java easiest cleanest O(n) solution ever!!!
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int clock = 0;\n        int counterclock = 0;\
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int clock = 0;\n        int counterclock = 0;\n        for(int i =0;i<distance.length;i++){\n            if(i>=start&&i<destination || i<start&&i>=destination) clock+=distance[i];\n            else counterclock+=distance[i];\n        }\n        return Math.min(clock,counterclock);\n    }\n}\n```
['Java']