GitHub PushEvent at 2014-09-18 20:54:35
Repository: leetcode
Actor: kapalani
Payload: {"shas":[["203a84bdf89a7007b467fdf5f084102a2a4d7966","7e650970f369c2521c1447304eaa521888d23369@gmail.com","Gas Station\n\nThere are N gas stations along a circular route, where the amount of gas\nat station i is gas[i].\n\nYou have a car with an unlimited gas tank and it costs cost[i] of gas to\ntravel from station i to its next station (i+1). You begin the journey\nwith an empty tank at one of the gas stations.\n\nReturn the starting gas station's index if you can travel around the\ncircuit once, otherwise return -1.\n\nNote:\nThe solution is guaranteed to be unique.","kapalani",true]],"size":1,"ref":"refs/heads/master","head":"203a84bdf89a7007b467fdf5f084102a2a4d7966"}