Simple Java sol(Storing Sum)
\npublic int distanceBetweenBusStops(int[] distance, int start, int destination) {\n\n        int n = distance.length;\n        int[] left = new int[n];\n      
```\npublic int distanceBetweenBusStops(int[] distance, int start, int destination) {\n\n        int n = distance.length;\n        int[] left = new int[n];\n        int[] right = new int[n];\n\n        left[0]=right[0]=0;\n        int sum = distance[0];\n        for (int i=1;i<n;i++) {\n            left[i] = distance[i-1]+left[i-1];\n            sum+=distance[i];\n        }\n\n        right[n-1]=distance[n-1];\n        for (int i=n-2;i>=1;i--) {\n            right[i]=right[i+1]+distance[i];\n        }\n\n        if(start == 0) {\n            return Math.min(left[destination],right[destination]);\n        } else {\n            int min = Math.min(start,destination);\n            int max = Math.max(start,destination);\n            return Math.min((left[min]+right[max]),(sum-(left[min]+right[max])));\n        }\n\n    }\n```
[]