Gas Station

#134
Medium
Greedy
O(n)
O(1)
Amazon
Facebook
Google
View on LeetCode

Problem Description

There are n gas stations along a circular route. Given two arrays gas and cost, return the starting gas station's index if you can travel around the circuit once.