Java solution - Runtime 0 ms (One pass)
\n  public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n    int s1 = 0, s2 = 0;\n    int begin = start < destination ? start : des
```\n  public int distanceBetweenBusStops(int[] distance, int start, int destination) {\n    int s1 = 0, s2 = 0;\n    int begin = start < destination ? start : destination;\n    int end = start < destination ? destination : start;\n    for (int i = 0; i < distance.length; i++) {\n      s1 += distance[i];\n      if (i >= begin && i < end) {\n        s2 += distance[i];\n      }\n    }\n    return Math.min(s2, Math.abs(s1 - s2));\n  }\n  ```
[]