Truck Tour HackerRank Problem

Truck Tour 1.py

def solve(petrol,distance,n):
    start,tank=0,0
    for i in range(n):          #Start from each index
        start=i
        tank=0                  #Reset the tank for each iteration
        for j in range(n):
            current=(start+j)%n         #To make the index in range for circular array
            tank+=petrol[current]-distance[current]     #Add the petrol and subtract the petrol required to reach next station
            if tank<0:      #If petrol in tank becomes negative, we cannot complete the loop
                break
            if j==n-1:      #If we visit all n pumps, task is completed
                return start
 
n=int(input())
petrol,distance=[],[]
for i in range(n):
    p,d=[int(x) for x in input().split()]
    petrol.append(p),distance.append(d)
print(solve(petrol,distance,n))