Circular tour problem

how this question is done using queue i read the article on gfg ,cannot understand ,can you dry run and show the approch?
https://practice.geeksforgeeks.org/problems/circular-tour/1
Article–>

Hey @sheikhhaji18
Refer to this https://www.youtube.com/watch?v=oAUNU01Y6V4
watch from brute force solution

i understand that we enqueue at the last , till the petrol is there for travelling for the next stop, when its not possible we dequeue from the front() , start from the q.front() again.


can u answer this alone,in step 1 why we are doing +2-2=0
i understand that its possible to start from the first petrol bank because (6-4)=-2
so we have to start from the second petrol bank
but why are we doing -2+2=0?
@Kartikkhariwal1 r u there?
we want to start fresh that’s why are making the curent_petrol as zero is that right?

We are incrementing starting point until total petrol becomes positive