Simple Java Solution
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int l=0,r=0;\n        if(start>destination)\n 
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int l=0,r=0;\n        if(start>destination)\n        {\n            int temp=start;\n            start=destination;\n            destination=temp;\n        }\n        for(int i=start;i<destination;i++)\n        {\n            l=l+distance[i];\n        }\n        int j=destination+1;\n        int prev=destination;\n        if(j==distance.length)\n        {\n              j=0;\n        }\n        while(j!=start)\n        {                 \n            r=r+distance[prev];\n            prev=j;\n            j++;\n            if(j==distance.length)\n            {\n                j=0;\n            }\n        }\n        r=r+distance[prev];\n        \n        return (int)Math.min(l,r);\n        \n    }\n}\n```
[]