Swift - optimal solution (100%)
\nclass Solution {\n    func distanceBetweenBusStops(_ distance: [Int], _ start: Int, _ destination: Int) -> Int {\n        var dist1 = 0\n        var dist2 = 0
```\nclass Solution {\n    func distanceBetweenBusStops(_ distance: [Int], _ start: Int, _ destination: Int) -> Int {\n        var dist1 = 0\n        var dist2 = 0\n        \n        let stop1 = min(start, destination)\n        let stop2 = max(start, destination)\n        \n        for i in stop1..<stop2 {\n            dist1 += distance[i]\n        }\n        \n        for i in 0..<stop1 {\n            dist2 += distance[i]\n        }\n        \n        for i in stop2..<distance.count {\n            dist2 += distance[i]\n        }\n        \n        return min(dist1, dist2)\n        \n    }\n}\n```
['Swift']