Practice Gas Station
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from the ith station to its next (i + 1)th station. You begin the journey with an empty tank at one of the gas stations. Given two integer arrays gas and cost, return the starting gas station's index if you can travel around the circuit once in the clockwise direction, otherwise return -1. If there exists a solution, it is guaranteed to be unique.
Source: Gas Station on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
gas = [1,2,3,4,5], cost = [3,4,5,1,2]
3
# Example 2
gas = [2,3,4], cost = [3,4,3]
-1
Constraints
Related LeetCode Problems
Practice more problems similar to Gas Station.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.