Simplest solution | Easiest to understand | Very very easy | 0ms runtime | Faster than 100%
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        \n        int forwardDis=0;\n        int backw
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        \n        int forwardDis=0;\n        int backwardDis=0;\n        int n= distance.length;\n        \n        for(int i= start;i!=destination;i=(i+1)%n)\n        {\n            forwardDis= forwardDis+distance[i];\n        }\n        \n        for(int i= destination;i!=start;i=(i+1)%n)\n        {\n            backwardDis= backwardDis+distance[i];\n        }\n        \n        return Math.min(forwardDis,backwardDis);\n        \n    }\n}\n```
[]