Java 100/100 easy
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n\t\t// distanct[i] : cost of i ~ (i+1)%n\n\t\t// min(t
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n\t\t// distanct[i] : cost of i ~ (i+1)%n\n\t\t// min(total(distance), start~dest)\n\t\tint sum = 0;\n\t\tfor(int n : distance) sum += n;\n\t\tint cost = 0;\n        if(start > destination) {\n            int temp = start;\n            start = destination;\n            destination = temp;\n        }\n\t\tfor(int i=start; i<destination; i++) {\n\t\t\tcost += distance[i];\n\t\t}\n\t\treturn Math.min(cost, sum - cost);\n\t}\n}\n```
['Java']