FASTER THAN 100% || Super Simple || Java
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int firstDistance  = 0;\n        int secondDis
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        int firstDistance  = 0;\n        int secondDistance = 0;\n        if (start < destination) {\n            //check clockwise rotation\n            for (int i = start; i < destination; i++)\n                firstDistance += distance[i];\n            //check clockwise rotation from destination to end \n            for (int i = destination; i < distance.length; i++)\n                secondDistance += distance[i];\n            //continues checking till start (if needed)\n            for (int i = 0; i < start; i++)\n                secondDistance += distance[i];\n        }\n        else {\n            for (int i = start; i < distance.length; i++)\n                firstDistance += distance[i];\n            for (int i = 0; i < destination; i++)\n                firstDistance += distance[i];\n            for (int i = start - 1; i >= destination; i--)\n                secondDistance += distance[i];\n        }\n        return Math.min(firstDistance, secondDistance);\n    }\n}\n```
['Java']