A bus route has n stops numbered from $0$ to n $- 1$ arranged along a circle. You are given an integer array distance where distance[i] represents the distance between stop i and stop $(i + 1) \bmod$ n.

The bus can travel in either a clockwise or counterclockwise direction. Return the shortest distance between the given start and destination stops.

Constraints:

• $1 \leq$ n $\leq 10^4$

• distance.length $= n$

• $0 \leq$ start, destination $< n$

• $0 \leq$ distance[i] $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.