There are $n$ gas stations along a circular route, where the amount of gas at the $i^{th}$ station is gas[i].

We have a car with an unlimited gas tank, and it costs cost[i] of gas to travel from the $i^{th}$ station to the next $(i+1)^{th}$ station. We begin the journey with an empty tank at one of the gas stations.

Find the index of the gas station in the integer array gas such that if we start from that index we may return to the same index by traversing through all the elements, collecting gas[i] and consuming cost[i].

• If it is not possible, return -1.

• If there exists such index, it is guaranteed to be unique.

Constraints:

• gas.length $==$ cost.length
• 1 $\leq$ gas.length, cost.length $\leq 10^3$
• 0 $\leq$ gas[i], cost[i] $\leq 10^3$

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 main.py in the following coding playground.