🏅C++ || SIMPLE AND SHORT EASY TO UNDERSTAND SOLUTION
\n      \n\t\t\t Going from Start to Destination and then from Destination to start as \n\t\t\t the bus stops are connected in a circle then returning the minim
\n      \n\t\t\t Going from Start to Destination and then from Destination to start as \n\t\t\t the bus stops are connected in a circle then returning the minimum of both trips.\n\t\t\t TC : O(N)\n\t\t\t SC: O(1)\n\t\t\t \n\t\t class Solution {\n\t\t public:\n\t\t int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n\t\t int d1=0,d2=0;\n\t\t int newdestination=start;\n\t\t int n=distance.size();\n\t\t while(start!=destination){\n\t\t\t\t d1+=distance[start];\n\t\t\t\t start=(start+1)%n;}\n\t\t while(start!=newdestination) {\n\t\t\t\t d2+=distance[start]; \n\t\t\t\t start=(start+1)%n;}\n        \n        return min(d1,d2);\n        \n    }\n};\n\'\'\'
['C', 'C++']