Clean Java Solution 100% Both Run-time and Space
\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        \n        int i = start;\n        int j = dest
```\nclass Solution {\n    public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n        \n        int i = start;\n        int j = destination;\n        int fwd = 0;\n        while (i != j) {\n            fwd += distance[i];\n            i += 1;\n            i = (i % distance.length);\n        }\n        i = start;\n        j = destination;\n        int bck = 0;\n        while (i != j) {\n            i -= 1;\n            if (i < 0) {\n                i = (distance.length - 1);\n            }            \n            bck += distance[i];\n        }\n        return Math.min(fwd, bck);\n    }\n}\n```
[]