Java Faster than 100% Solution
class Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n\t\n        int total = 0;\n        int forwardDirection
class Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n\t\n        int total = 0;\n        int forwardDirection = 0;\n        \n        if(start > destination){\n            int temp = start;\n            start = destination;\n            destination = temp;\n        }\n        \n        for(int i = 0; i < distance.length; i++){\n            total += distance[i];\n            if(i >= start && i < destination) forwardDirection += distance[i];\n        }\n        \n        return Math.min(total-forwardDirection, forwardDirection);\n        \n    }\n}
[]