while incrementing i=(i+1)% size this is very imp !!!!!  time laga anyways :D
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {\n      \n      int front=0;\n      int back=0;\n\n      int n=distance.size();\n      for(int i=start;i!=destination;i=(i+1)%n)\n      {\n          front+=distance[i];\n      }\n\n      for(int i=destination;i!=start;i=(i+1)%n)\n      {\n        //i=i%n;\n        back+=distance[i];\n      }\n\n\n      return min(front,back);\n        \n    }\n};\n```
['C++']