Java - Beats 100% - Easy Solution
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int firstDistance = 0;\n        int secondDist
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int firstDistance = 0;\n        int secondDistance = 0;\n        \n\t\t/* Check one way (from start to destination) */\n        for (int i = start; i != destination; i = (i + 1) % distance.length) {\n            firstDistance += distance[i];\n        }\n        \n\t\t/* Check other way (from destination to start) */\n        for (int i = destination; i != start; i = (i + 1) % distance.length ) {\n            secondDistance += distance[i];\n        }\n        \n        return Math.min(firstDistance, secondDistance);\n    }\n}\n```
[]