✅C++ || 2 Line code || EASY && CLEAN
\n\nT->O(n) && S->O(1)\n\n\tclass Solution {\n\tpublic:\n\t\tint distanceBetweenBusStops(vector& dis, int s, int d) {\n\t\t\tint n=dis.size();\n\t\t\tint a=0,b=
![image](https://assets.leetcode.com/users/images/14ab9d3b-cefe-4c61-ad11-707d6a356cee_1656913343.6105776.png)\n\n**T->O(n) && S->O(1)**\n\n\tclass Solution {\n\tpublic:\n\t\tint distanceBetweenBusStops(vector<int>& dis, int s, int d) {\n\t\t\tint n=dis.size();\n\t\t\tint a=0,b=0;\n\t\t\tfor(int i=s;i!=d;i=(i+1)%n) a+=dis[i];\n\t\t\tfor(int i=d;i!=s;i=(i+1)%n) b+=dis[i];\n\t\t\treturn min(a,b);\n\t\t}\n\t};
['C', 'C++']